150 search results - page 20 / 30 » Solving Permutation Constraint Satisfaction Problems with Ar... |
172
click to vote
ECAI
2000
Springer
15 years 10 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...
159
click to vote
AIPS
1994
15 years 7 months ago
1994
An intelligent problem solver must be able to decompose a complex problem into simpler parts. A decomposition algorithm would not only be bene cial for traditional subgoal-oriente...
147
click to vote
ECAI
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
166
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...
135
Voted
NOMS
2000
IEEE
15 years 10 months ago
2000
IEEE
Communication networks are expected to offer a wide range of services to an increasingly large number of users, with a diverse range of quality of service. This calls for efficien...