279 search results - page 16 / 56 » Testing for Refinement in CSP |
123
click to vote
CCIA
2008
Springer
15 years 4 months ago
2008
Springer
Meetings are an important vehicle for human interaction. The Meeting Scheduling problem (MS) considers several agents, each holding a personal calendar, and a number of meetings wh...
95
Voted
FLAIRS
2003
15 years 4 months ago
2003
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
137
Voted
IJCAI
2003
15 years 4 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
117
Voted
IJCAI
1989
15 years 3 months ago
1989
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of p...
115
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...