475 search results - page 6 / 95 » Feasible distributed CSP models for scheduling problems |
JAR
2000
13 years 7 months 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...
IJCAI
2007
13 years 9 months ago
2007
This paper investigates how to represent and solve multiagent task scheduling as a Distributed Constraint Optimization Problem (DCOP). Recently multiagent researchers have adopted...
AI
2005
Springer
13 years 7 months ago
2005
Springer
Constraint Satisfaction Problems (CSP) have been very successful in problem-solving tasks ranging from resource allocation and scheduling to configuration and design. Increasingly...
WSC
1998
13 years 8 months ago
1998
In this paper, we present an approach for measuring certain properties of synthetic optimization problems based on the assumed distribution of coefficient values. We show how to e...
AI
2005
Springer
13 years 7 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...