Sciweavers

596 search results - page 1 / 120
» Search Strategies for Hybrid Search Spaces
Sort
View
ICTAI
1999
IEEE
13 years 9 months ago
Search Strategies for Hybrid Search Spaces
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
Carla P. Gomes, Bart Selman
GECCO
2010
Springer
217views Optimization» more  GECCO 2010»
13 years 6 months ago
Benchmarking CMA-EGS on the BBOB 2010 noiseless function testbed
This paper describes the implementation and the results for CMA-EGS on the BBOB 2010 noiseless function testbed. The CMA-EGS is a hybrid strategy which combines elements from grad...
Steffen Finck, Hans-Georg Beyer
SBIA
2004
Springer
13 years 10 months ago
Detecting Promising Areas by Evolutionary Clustering Search
A challenge in hybrid evolutionary algorithms is to define efficient strategies to cover all search space, applying local search only in actually promising search areas. This pape...
Alexandre César Muniz de Oliveira, Luiz Ant...
JAR
2000
90views more  JAR 2000»
13 years 4 months ago
Resolution versus Search: Two Strategies for SAT
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...
Irina Rish, Rina Dechter
AAAI
2007
13 years 7 months ago
Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning
We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuristics to produce optimal sequential plans. It integrates its ...
Stéphane Grandcolas, C. Pain-Barre