Sciweavers

4229 search results - page 416 / 846
» On the Optimality of Spiral Search
Sort
View
GECCO
2008
Springer
110views Optimization» more  GECCO 2008»
15 years 8 months ago
Genetic programming for finite algebras
We describe the application of genetic programming (GP) to a problem in pure mathematics, in the study of finite algebras. We document the production of human-competitive results...
Lee Spector, David M. Clark, Ian Lindsay, Bradford...
179
Voted
GECCO
2008
Springer
159views Optimization» more  GECCO 2008»
15 years 8 months ago
IGAP: interactive genetic algorithm peer to peer
We present IGAP, a peer to peer interactive genetic algorithm which reflects the real world methodology followed in team design. We apply our methodology to floorplanning. Throu...
Juan C. Quiroz, Amit Banerjee, Sushil J. Louis
CG
2002
Springer
15 years 6 months ago
Tackling Post's Correspondence Problem
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...
Ling Zhao
208
Voted
HEURISTICS
1998
103views more  HEURISTICS 1998»
15 years 6 months ago
Computing Approximate Solutions of the Maximum Covering Problem with GRASP
We consider the maximum covering problem, a combinatorial optimization problem that arises in many facility location problems. In this problem, a potential facility site covers a s...
Mauricio G. C. Resende
181
Voted
IPCO
2010
210views Optimization» more  IPCO 2010»
15 years 5 months ago
A 3-Approximation for Facility Location with Uniform Capacities
We consider the facility location problem where each facility can serve at most U clients. We analyze a local search algorithm for this problem which uses only the operations of ad...
Ankit Aggarwal, L. Anand, Manisha Bansal, Naveen G...