Sciweavers

84 search results - page 1 / 17
» Pruning State Spaces with Extended Beam Search
Sort
View
ATVA
2007
Springer
118views Hardware» more  ATVA 2007»
13 years 11 months ago
Pruning State Spaces with Extended Beam Search
This paper focuses on using beam search, a heuristic search algorithm, for pruning state spaces while generating. The original beam search is adapted to the state space generation ...
Muhammad Torabi Dashti, Anton Wijs
PADL
2004
Springer
13 years 10 months ago
Pruning in the Extended Andorra Model
One of the major problems that actual logic programming systems have to address is whether and how to prune undesirable parts of the search space. A region of the search space woul...
Ricardo Lopes, Vítor Santos Costa, Fernando...
ECML
1993
Springer
13 years 9 months ago
Decision Tree Pruning as a Search in the State Space
Floriana Esposito, Donato Malerba, Giovanni Semera...
AIPS
2006
13 years 6 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith
GLVLSI
2009
IEEE
122views VLSI» more  GLVLSI 2009»
13 years 11 months ago
Enhancing SAT-based sequential depth computation by pruning search space
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...
Yung-Chih Chen, Chun-Yao Wang