277 search results - page 28 / 56 » Conditional Lexicographic Orders in Constraint Satisfaction ... |
103
Voted
ECAI
2008
Springer
14 years 11 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
CP
2003
Springer
15 years 2 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,...
68
Voted
SSD
2007
Springer
15 years 3 months ago
2007
Springer
In this paper we study the evaluation of continuous constraint queries (CCQs) for spatiotemporal streams. A CCQ triggers an alert whenever a configuration of constraints between s...
180
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
AI
2005
Springer
14 years 9 months ago
2005
Springer
Because of privacy concerns, agents may not want to reveal information that could be of use in problem solving. As a result, there are potentially important tradeoffs between main...