Sciweavers

1830 search results - page 250 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
GECCO
2005
Springer
228views Optimization» more  GECCO 2005»
15 years 3 months ago
Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
Ashish Sureka, Peter R. Wurman
GECCO
2003
Springer
15 years 3 months ago
Enhancing the Performance of GP Using an Ancestry-Based Mate Selection Scheme
The performance of genetic programming relies mostly on population-contained variation. If the population diversity is low then there will be a greater chance of the algorithm bein...
Rodney Fry, Andrew M. Tyrrell
GECCO
2000
Springer
120views Optimization» more  GECCO 2000»
15 years 1 months ago
An Improved Adaptive Multi-Start Approach to Finding Near-Optimal Solutions to the Euclidean TSP
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
Dan Bonachea, Eugene Ingerman, Joshua Levy, Scott ...
CEC
2010
IEEE
14 years 11 months ago
Classifier-assisted constrained evolutionary optimization for automated geometry selection of orthodontic retraction spring
In orthodontics, retraction springs made of metallic wires are often used to move a tooth with respect to another by the virtue of the spring back effect. Specially selected form o...
Dudy Lim, Yew-Soon Ong, Rachman Setiawan, Muhammad...
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 1 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini