Sciweavers

717 search results - page 35 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
85 views 112 votes 15 years 2 months ago  IJCAI 2003»
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...
71 views 87 votes 15 years 1 months ago  IPL 2007»
Abstract. The Semiring Constraint Satisfaction Problem (SCSP) framework is a popular approach for the representation of partial constraint satisfaction problems. In this framework ...
92 views 80 votes 15 years 2 months ago  IJCAI 2001»
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
122 views 110 votes 15 years 7 months ago  ECAI 2004»
Super solutions are a mechanism to provide robustness to constraint programs [10]. They are solutions in which, if a small number of variables lose their values, we are guaranteed ...
137 views 109 votes 15 years 5 months ago  SPDP 1991»
This paper develops two new algorithms for solving a finite constraint satisfaction problem (FCSP) in parallel. In particular, we give a parallel algorithm for the EREW PRAM model...
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...