Sciweavers

717 search results - page 36 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
69 views 75 votes 15 years 1 months ago  CORR 2010»
DCSP (Distributed Constraint Satisfaction Problem) has been a very important research area in AI (Artificial Intelligence). There are many application problems in distributed AI t...
153 views 134 votes 15 years 7 months ago  CP 2005»
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
148 views 111 votes 15 years 6 months ago  PATAT 2004»
Timetabling problems have been frequently studied due to their wide range of applications. However, they are often solved manually because of the lack of appropriate computer tools...
87 views 116 votes 15 years 3 months ago  AIPS 2007»
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at...
97 views 135 votes 15 years 3 months ago  AIMSA 2008»
We present a hybrid approach to Distributed Constraint Satisfaction which combines incomplete, fast, penalty-based local search with complete, slower systematic search. Thus, we pr...
211 views 108 votes 15 years 2 months ago  ECAI 2010»
Abstract. This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonall...
122 views 120 votes 15 years 5 months ago  CP 1997»
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to nd a set of assignments to variables ...
148 views 134 votes 14 years 11 months ago  LICS 2010»
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
143 views 103 votes 15 years 2 months ago  IJCAI 2003»
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
101 views 101 votes 15 years 2 months ago  AAAI 1996»
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...