✦ LIBER ✦

A variable depth search branching

✍ Scribed by Fabien Cornillier; José Eduardo Pécora Jr.; Vincent Charles

Book ID: 113834629
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 636 KB
Volume: 40
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2012.03.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Depth-first proof search without backtra

Depth-first proof search without backtracking for free-variable clausal tableaux

✍ Bernhard Beckert 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 267 KB

We analyse the problem of constructing a deterministic proof procedure for free-variable clausal tableaux that performs depth-first proof search without backtracking; and we present a solution based on a fairness strategy. That strategy uses weight orderings and a notion of tableau subsumption to av

On the best search strategy in parallel

On the best search strategy in parallel branch‐and‐bound:Best‐First Search versus Lazy Depth‐First Search

✍ J. Clausen; M. Perregaard 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 111 KB

A parallel depth first search branch and

A parallel depth first search branch and bound algorithm for the quadratic assignment problem

✍ Bernard Mans; Thierry Mautor; Catherine Roucairol 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 770 KB

A supercritical branching process with v

A supercritical branching process with variable mode

✍ R. V. Boiko 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 261 KB

Depth-first search as a combinatorial co

Depth-first search as a combinatorial correspondence

✍ Ira Gessel; Da-Lun Wang 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 253 KB

A note on parallel depth first search

✍ Y. Zhang 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 122 KB