566 search results - page 13 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
126
Voted
BPSC
2009
15 years 1 months ago
2009
Abstract: In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle t levels of...
128
Voted
ATAL
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
101
click to vote
JAR
2000
15 years 1 days ago
2000
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
111
Voted
SODA
2010
ACM
15 years 9 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
117
Voted
AI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Variables and constraints in problem domains are often distributed. These distributed constraint satisfaction problems (DCSPs) lend themselves to multiagent solutions. Mo...