|
Search the dblp DataBase
Eduardo Rodriguez-Tello:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez
Memetic Algorithms for the MinLA Problem. [Citation Graph (0, 0)][DBLP] Artificial Evolution, 2005, pp:73-84 [Conf]
- Eduardo Rodriguez-Tello, Jose Torres-Jimenez
ERA: An Algorithm for Reducing the Epistasis of SAT Problems. [Citation Graph (0, 0)][DBLP] GECCO, 2003, pp:1283-1294 [Conf]
- Eduardo Rodriguez-Tello, Jose Torres-Jimenez
Improving the Performance of a Genetic Algorithm Using a Variable-Reordering Algorithm. [Citation Graph (0, 0)][DBLP] GECCO (2), 2004, pp:102-113 [Conf]
- Jose Torres-Jimenez, Eduardo Rodriguez-Tello, J. C. Ruiz-Suarez
A Genetic Algorithms for Matrix Bandwith Reduction. [Citation Graph (0, 0)][DBLP] GECCO, 2000, pp:388- [Conf]
- Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez
A Comparison of Memetic Recombination Operators for the MinLA Problem. [Citation Graph (0, 0)][DBLP] MICAI, 2005, pp:613-622 [Conf]
- Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez
A Refined Evaluation Function for the MinLA Problem. [Citation Graph (0, 0)][DBLP] MICAI, 2006, pp:392-403 [Conf]
- Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-Jimenez
An Improved Evaluation Function for the Bandwidth Minimization Problem. [Citation Graph (0, 0)][DBLP] PPSN, 2004, pp:652-661 [Conf]
- Jose Torres-Jimenez, Eduardo Rodriguez-Tello
A New Measure for the Bandwidth Minimization Problem. [Citation Graph (0, 0)][DBLP] IBERAMIA-SBIA, 2000, pp:477-486 [Conf]
Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three. [Citation Graph (, )][DBLP]
Strength Two Covering Arrays Construction Using a SAT Representation. [Citation Graph (, )][DBLP]
A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength. [Citation Graph (, )][DBLP]
An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs
|