✦ LIBER ✦

State-set branching: Leveraging BDDs for heuristic search

✍ Scribed by Rune M. Jensen; Manuela M. Veloso; Randal E. Bryant

Book ID: 103821347
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 583 KB
Volume: 172
Category: Article
ISSN: 0004-3702
DOI: 10.1016/j.artint.2007.05.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Combining ordered best-first search with

Combining ordered best-first search with branch and bound for exact BDD minimization

✍ Ebendt, R.; Gunther, W.; Drechsler, R. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 506 KB

Note: A local-search heuristic for large

Note: A local-search heuristic for large set-covering problems

✍ Larry W. Jacobs; Michael J. Brusco 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB

A face search heuristic algorithm for op

A face search heuristic algorithm for optimizing over the efficient set

✍ Harold P. Benson; Serpil Sayin 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 769 KB

An iterated-tabu-search heuristic for a

An iterated-tabu-search heuristic for a variant of the partial set covering problem

✍ Bilal, Nehme; Galinier, Philippe; Guibault, Francois 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 289 KB

Search for a spontaneous fission branch

Search for a spontaneous fission branch in a metastable state of 214Cm

✍ R. Vandenbosch; P.R. Fields; S.E. Vandenbosch; D. Metta 📂 Article 📅 1964 🏛 Elsevier Science ⚖ 342 KB

Planning graph as the basis for deriving

Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search

✍ XuanLong Nguyen; Subbarao Kambhampati; Romeo S. Nigenda 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 561 KB

Most recent strides in scaling up planning have centered around two competing themesdisjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP and HSP-r. In this paper, we present a novel approach for successfully harnessing the advantages of the t