Sciweavers

1047 search results - page 14 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
CP
2007
Springer
14 years 1 months ago
An LP-Based Heuristic for Optimal Planning
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners i...
Menkes van den Briel, J. Benton, Subbarao Kambhamp...
CP
2006
Springer
13 years 11 months ago
High-Level Nondeterministic Abstractions in
el Nondeterministic Abstractions in C++ Laurent Michel1 , Andrew See1 , and Pascal Van Hentenryck2 1 University of Connecticut, Storrs, CT 06269-2155 2 Brown University, Box 1910, ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
CORR
2007
Springer
131views Education» more  CORR 2007»
13 years 7 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...
ASPDAC
2004
ACM
112views Hardware» more  ASPDAC 2004»
13 years 11 months ago
Efficient reachability checking using sequential SAT
Abstract
Ganapathy Parthasarathy, Madhu K. Iyer, Kwang-Ting...
ICTAI
2010
IEEE
13 years 5 months ago
Continuous Search in Constraint Programming
This work presents the concept of Continuous Search (CS), which objective is to allow any user to eventually get their constraint solver achieving a top performance on their proble...
Alejandro Arbelaez, Youssef Hamadi, Michèle...