Sciweavers

2109 search results - page 132 / 422
» Solving Necklace Constraint Problems
Sort
View
AAAI
1996
15 years 7 months ago
Formalizing Dependency Directed Backtracking and Explanation Based Learning in Refinement Search
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving comm...
Subbarao Kambhampati
CORR
2008
Springer
76views Education» more  CORR 2008»
15 years 6 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher
CONSTRAINTS
2011
14 years 9 months ago
CP and IP approaches to cancer radiotherapy delivery optimization
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
Davaatseren Baatar, Natashia Boland, Sebastian Bra...
FLAIRS
2008
15 years 8 months ago
Distributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed t...
Yang Xiang, Wanling Zhang
JCP
2008
117views more  JCP 2008»
15 years 6 months ago
Selfish Constraint Satisfaction Genetic Algorithm for Planning a Long-distance Transportation Network
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints...
Takashi Onoyama, Takuya Maekawa, Yoshitaka Sakurai...