✦ LIBER ✦

Revisiting constraint-directed search

✍ Scribed by Magnus Ågren; Pierre Flener; Justin Pearson

Book ID: 113641815
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 459 KB
Volume: 207
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2008.12.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Interval propagation and search on direc

Interval propagation and search on directed acyclic graphs for numerical constraint solving

✍ Xuan-Ha Vu; Hermann Schichl; Djamila Sam-Haroud 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 913 KB

Revisiting decomposition analysis of geo

Revisiting decomposition analysis of geometric constraint graphs

✍ R. Joan-Arinyo; A. Soto-Riera; S. Vila-Marta; J. Vilaplana-Pastó 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 651 KB

Geometric problems defined by constraints can be represented by geometric constraint graphs whose nodes are geometric elements and whose arcs represent geometric constraints. Reduction and decomposition are techniques commonly used to analyze geometric constraint graphs in geometric constraint solvi

Free morpheme constraint revisited

✍ SHOJI AZUMA 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB

Indeterminacy and directed search

✍ Melvyn G. Coles; Jan Eeckhout 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 162 KB

Possible constraints on SUSY-model param

Possible constraints on SUSY-model parameters from direct dark matter search

✍ V.A. Bednyakov; H.V. Klapdor-Kleingrothaus; S.G. Kovalenko 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 321 KB

Evolutionary Gradient Search Revisited

✍ Arnold, D.V.; Salomon, R. 📂 Article 📅 2007 🏛 IEEE 🌐 English ⚖ 660 KB