565 search results - page 13 / 113 » Heuristics for Planning with SAT |
103
click to vote
AAAI
2008
15 years 4 months ago
2008
We study the relative best-case performance of DPLL-based structure-aware SAT solvers in terms of the power of the underlying proof systems. The systems result from (i) varying th...
104
click to vote
AIPS
2008
15 years 4 months ago
2008
The development of informative, admissible heuristics for cost-optimal planning remains a significant challenge in domain-independent planning research. Two techniques are commonl...
95
Voted
INFORMATICALT
2010
15 years 9 days ago
2010
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer science, with many applications in a range of domains, including software and hardware veriï...
113
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
121
click to vote
AIPS
2008
15 years 4 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...