The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Eduardo Rodriguez-Tello: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]

  9. Memetic Algorithms for Constructing Binary Covering Arrays of Strength Three. [Citation Graph (, )][DBLP]


  10. Strength Two Covering Arrays Construction Using a SAT Representation. [Citation Graph (, )][DBLP]


  11. A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength. [Citation Graph (, )][DBLP]


  12. An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002