Walter Cedeño

According to our database, Walter Cedeño authored at least 9 papers between 1993 and 2005.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2005

The enhanced evolutionary tabu search and its application to the quadratic assignment problem.

John F. McLoughlin III, Walter Cedeño

Proceedings of the Genetic and Evolutionary Computation Conference, 2005

A Comparison of Particle Swarms Techniques for the Development of Quantitative Structure-Activity Relationship Models for Drug Design.

Walter Cedeño, Dimitris K. Agrafiotis

Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005

2003

Using particle swarms for the development of QSAR models based on K-nearest neighbor and kernel regression.

Walter Cedeño, Dimitris K. Agrafiotis

J. Comput. Aided Mol. Des., 2003

2002

On the Use of Neural Network Ensembles in QSAR and QSPR.

Dimitris K. Agrafiotis, Walter Cedeño, Victor S. Lobanov

J. Chem. Inf. Comput. Sci., 2002

2001

A design for DNA computation of the OneMax problem.

David Harlan Wood, Junghuei Chen, Eugene Antipov, Bertrand Lemieux, Walter Cedeño

Soft Comput., 2001

1999

Analysis of Speciation and Niching in the Multi-Niche Crowding GA.

Walter Cedeño, V. Rao Vemuri

Theor. Comput. Sci., 1999

<i>In vitro</i> selection for a OneMax DNA evolutionary computation.

David Harlan Wood, Junghuei Chen, Eugene Antipov, Bertrand Lemieux, Walter Cedeño

Proceedings of the DNA Based Computers, 1999

1994

Multi-Niche Crowding in Genetic Algorithms and its Application to the Assembly of DNA Restriction-Fragments.

Walter Cedeño, V. Rao Vemuri, Tom Slezak

Evol. Comput., 1994

1993

A note on frucht diagrams, boolean graphs and hamilton cycles.

Italo J. Dejter, Walter Cedeño, V. Jauregui

Discret. Math., 1993