Sciweavers

COMBINATORICS
1998
66views more  COMBINATORICS 1998»
13 years 2 months ago
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
Geoffrey Exoo
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 2 months ago
How to use the Scuba Diving metaphor to solve problem with neutrality ?
Abstract. We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality which exists in ...
Philippe Collard, Sébastien Vérel, M...
CORR
2007
Springer
108views Education» more  CORR 2007»
13 years 2 months ago
Scuba Search : when selection meets innovation
— We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape....
Sébastien Vérel, Philippe Collard, M...
EC
2008
146views ECommerce» more  EC 2008»
13 years 2 months ago
Automated Discovery of Local Search Heuristics for Satisfiability Testing
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
Alex S. Fukunaga
FOCS
1999
IEEE
13 years 6 months ago
Learning Mixtures of Gaussians
Mixtures of Gaussians are among the most fundamental and widely used statistical models. Current techniques for learning such mixtures from data are local search heuristics with w...
Sanjoy Dasgupta
GECCO
2004
Springer
148views Optimization» more  GECCO 2004»
13 years 8 months ago
Evolving Local Search Heuristics for SAT Using Genetic Programming
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
Alex S. Fukunaga
WINE
2005
Springer
139views Economy» more  WINE 2005»
13 years 8 months ago
Price of Anarchy, Locality Gap, and a Network Service Provider Game
In this paper, we define a network service provider game. We show that the price of anarchy of the defined game can be bounded by analyzing a local search heuristic for a related...
Nikhil R. Devanur, Naveen Garg, Rohit Khandekar, V...