Sciweavers

335 search results - page 20 / 67
» gecco 2005
Sort
View
GECCO
2005
Springer
143views Optimization» more  GECCO 2005»
15 years 3 months ago
Solving geometric TSP with ants
This paper presents an ant-based approach for solving the Traveling Salesman Problem (TSP). Novel concepts of this algorithm that distinguish it from the other heuristics are the ...
Thang Nguyen Bui, Mufit Colpan
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
15 years 3 months ago
A hybrid evolutionary algorithm for the p-median problem
A hybrid evolutionary algorithm (EA) for the p-median problem consist of two stages, each of which is a steady-state hybrid EA. These EAs encode selections of medians as subsets o...
István Borgulya
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
GECCO
2005
Springer
110views Optimization» more  GECCO 2005»
15 years 3 months ago
Towards identifying populations that increase the likelihood of success in genetic programming
This paper presents a comprehensive, multivariate account of how initial population material is used over the course of a genetic programming run as while various factors influenc...
Jason M. Daida
GECCO
2005
Springer
190views Optimization» more  GECCO 2005»
15 years 3 months ago
An efficient evolutionary algorithm applied to the design of two-dimensional IIR filters
This paper presents an efficient technique of designing twodimensional IIR digital filters using a new algorithm involving the tightly coupled synergism of particle swarm optimiza...
Swagatam Das, Amit Konar, Uday Kumar Chakraborty