Sciweavers

4229 search results - page 394 / 846
» On the Optimality of Spiral Search
Sort
View
GECCO
2004
Springer
16 years 6 days ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer
GECCO
2004
Springer
16 years 6 days ago
The Royal Road Not Taken: A Re-examination of the Reasons for GA Failure on R1
Previous work investigating the performance of genetic algorithms (GAs) has attempted to develop a set of fitness landscapes, called “Royal Roads” functions, which should be id...
Brian Howard, John Sheppard
GECCO
2004
Springer
120views Optimization» more  GECCO 2004»
16 years 6 days ago
Comparison of Selection Strategies for Evolutionary Quantum Circuit Design
Evolution of quantum circuits faces two major challenges: complex and huge search spaces and the high costs of simulating quantum circuits on conventional computers. In this paper ...
André Leier, Wolfgang Banzhaf
GECCO
2003
Springer
122views Optimization» more  GECCO 2003»
16 years 1 days ago
Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem
The Linear Ordering Problem(LOP), which is a well-known NP-hard problem, has numerous applications in various fields. Using this problem as an example, we illustrate a general pro...
Gaofeng Huang, Andrew Lim
ISAAC
2003
Springer
104views Algorithms» more  ISAAC 2003»
16 years 15 hour ago
Deterministic Algorithm for the t-Threshold Set Problem
Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
Jérémy Barbay, Claire Kenyon