566 search results - page 29 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
110
click to vote
CP
1998
Springer
15 years 4 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
148
click to vote
PACT
1999
Springer
15 years 4 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
CSCLP
2004
Springer
15 years 5 months ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
65
Voted
KBS
2007
15 years 9 days ago
2007
Restaurant table management can have significant impact on both profitability and the customer experience. The core of the issue is a complex dynamic combinatorial problem. We sho...
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
In this paper, we describe a technique to temporally sort a collection of photos that span many years. By reasoning about persistence of visible structures, we show how this sorti...