Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

अन्य संस्करण दिखाएं (2)

The Constraint Satisfaction Problem (CSP) is a central generic problem in artificial intelligence. Considerable progress has been made in identifying properties which ensure tractability in such problems, such as the property of being tree-structured. In this paper we introduce the broken-triangle p...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखकों: Cooper, M, Jeavons, P, Salamon, A
स्वरूप: Journal article
भाषा:English
प्रकाशित: 2010
Search Result 1
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination द्वारा Cooper, M, Jeavons, P, Salamon, A

प्रकाशित 2010
Journal article
Search Result 2
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination द्वारा Cooper, M, Jeavons, P, Salamon, A

प्रकाशित 2010
Journal article
सभी संस्करण दिखाएं (3)

समान संसाधन