| 2005 | ||
|---|---|---|
| c2 | Walter Cedeño, Dimitris K. Agrafiotis: A Comparison of Particle Swarms Techniques for the Development of Quantitative Structure-Activity Relationship Models for Drug Design. CSB Workshops 2005: 322-331 | |
| c1 | John F. McLoughlin III, Walter Cedeño: The enhanced evolutionary tabu search and its application to the quadratic assignment problem. GECCO 2005: 975-982 | |
| 2003 | ||
| j6 | Walter Cedeño, Dimitris K. Agrafiotis: Using particle swarms for the development of QSAR models based on K-nearest neighbor and kernel regression. Journal of Computer-Aided Molecular Design 17(2-4): 255-263 (2003) | |
| 2002 | ||
| j5 | Dimitris K. Agrafiotis, Walter Cedeño, Victor S. Lobanov: On the Use of Neural Network Ensembles in QSAR and QSPR. Journal of Chemical Information and Computer Sciences 42(4): 903-911 (2002) | |
| 2001 | ||
| j4 | David Harlan Wood, Junghuei Chen, Eugene Antipov, Bertrand Lemieux, Walter Cedeño: A design for DNA computation of the OneMax problem. Soft Comput. 5(1): 19-24 (2001) | |
| 1999 | ||
| j3 | Walter Cedeño, V. Rao Vemuri: Analysis of Speciation and Niching in the Multi-Niche Crowding GA. Theor. Comput. Sci. 229(1): 177-197 (1999) | |
| 1994 | ||
| j2 | Walter Cedeño, V. Rao Vemuri, Tom Slezak: Multi-Niche Crowding in Genetic Algorithms and its Application to the Assembly of DNA Restriction-Fragments. Evolutionary Computation 2(4): 321-345 (1994) | |
| 1993 | ||
| j1 | Italo J. Dejter, Walter Cedeño, V. Jauregui: A note on frucht diagrams, boolean graphs and hamilton cycles. Discrete Mathematics 114(1-3): 131-135 (1993) | |
| 1 | Dimitris K. Agrafiotis | |
| 2 | Eugene Antipov | |
| 3 | Junghuei Chen | |
| 4 | Italo J. Dejter | |
| 5 | V. Jauregui | |
| 6 | Bertrand Lemieux | |
| 7 | Victor S. Lobanov | |
| 8 | John F. McLoughlin III | |
| 9 | Tom Slezak | |
| 10 | V. Rao Vemuri | |
| 11 | David Harlan Wood |
Colors in the list of coauthors
Last update Tue May 21 05:06:12 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page