566 search results - page 36 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
101
click to vote
CSCLP
2007
Springer
15 years 6 months ago
2007
Springer
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
CONSTRAINTS
2002
15 years 8 days ago
2002
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring tha...
ASPDAC
1999
ACM
15 years 4 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
102
click to vote
CISSE
2008
Springer
15 years 2 months ago
2008
Springer
: Many real world problems appear naturally as constraints satisfaction problems (CSP), for which very efficient algorithms are known. Most of these involve the combination of two ...
125
Voted
AI
1999
Springer
15 years 4 days ago
1999
Springer
Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation 6,45 , negotiation 33 , distributed planning 5 , and coalit...