105 search results - page 8 / 21 » Some Applications of Graph Bandwidth to Constraint Satisfact... |
116
click to vote
EVOW
2005
Springer
15 years 10 months ago
2005
Springer
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
146
click to vote
AAAI
1994
15 years 5 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
152
click to vote
FASE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Graph constraints were introduced in the area of graph transformation, in connection with the notion of (negative) application conditions, as a form to limit the applicab...
175
click to vote
ICTAI
2009
IEEE
15 years 2 months ago
2009
IEEE
We propose a new method for solving structured CSPs which generalizes and improves the Cyclic-Clustering approach [4]. First, the cutset and the tree-decomposition of the constrai...
152
click to vote
ECAI
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...