566 search results - page 40 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
173
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...
171
click to vote
ISAAC
2007
Springer
16 years 3 days ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
160
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...
156
click to vote
CP
1998
Springer
15 years 10 months ago
1998
Springer
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
165
click to vote
CPAIOR
2010
Springer
15 years 10 months ago
2010
Springer
We present a new method to compute upper bounds of the number of solutions of binary integer programming (BIP) problems. Given a BIP, we create a dynamic programming (DP) table for...