466 search results - page 20 / 94 » Preprocessing Search Spaces for Branch and Bound Search |
GLVLSI
2009
IEEE
15 years 4 months ago
2009
IEEE
The sequential depth determines the completeness of bounded model checking in design verification. Recently, a SATbased method is proposed to compute the sequential depth of a de...
102
Voted
AAAI
2007
14 years 12 months ago
2007
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 ...
78
Voted
KI
2001
Springer
15 years 2 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
NGC
2006
Springer
14 years 9 months ago
2006
Springer
The authoring of fictional stories is considered a creative process. The purpose of most story authoring is not to invent a new style or genre of story that will be accepted by the...
106
click to vote
ISCI
2007
14 years 9 months ago
2007
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...