✦ LIBER ✦

Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search

✍ Scribed by P.P. Chakrabarti

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 756 KB
Volume: 65
Category: Article
ISSN: 0004-3702
DOI: 10.1016/0004-3702(94)90020-5

No coin nor oath required. For personal study only.

✦ Synopsis

Chakrabarti, P.P., Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search, Artificial Intelligence 65 (1994) 329-345.

We present algorithms for finding out optimal cost solutions of an explicit AND/OR graph. We show that these new algorithms can work on AND/OR graphs containing cycles. Finally, we show how these algorithms can be incorporated in implicit graph search schemes like AO* so that they work for transformation rules which lead to graphs with cycles.

📜 SIMILAR VOLUMES

An admissible and optimal algorithm for

An admissible and optimal algorithm for searching AND/OR graphs

✍ C.L. Chang; J.R. Slagle 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 964 KB

The State Reduction and Related Algorith

The State Reduction and Related Algorithms and Their Applications to the Study of Markov Chains, Graph Theory, and the Optimal Stopping Problem

✍ Isaac Sonin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We discuss the State ReductionÂGTH (Grassmann, Taksar, Heyman) algorithm for recursively finding invariant measure. We demonstrate the relationship between this algorithm and the Freidlin Wentzell ``tree decomposition'' approach to study the characteristics of Markov chains. The structure of the Sta

Proposal of a cannibalism bug-based sear

Proposal of a cannibalism bug-based search strategy using genetic algorithms (C-BUGS) and its application to multiobjective optimization problems

✍ Keiichiro Yasuda; Osamu Yamazaki; Takao Watanabe 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 269 KB 👁 1 views

The minimized dead-end elimination crite

The minimized dead-end elimination criterion and its application to protein redesign in a hybrid scoring and search algorithm for computing partition functions over molecular ensembles

✍ Ivelin Georgiev; Ryan H. Lilien; Bruce R. Donald 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 668 KB

## Abstract One of the main challenges for protein redesign is the efficient evaluation of a combinatorial number of candidate structures. The modeling of protein flexibility, typically by using a rotamer library of commonly‐observed low‐energy side‐chain conformations, further increases the comple