Sciweavers

717 search results - page 19 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
83 views 131 votes 15 years 6 months ago  WLP 2004»
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
153 views 107 votes 15 years 1 months ago  AAMAS 2000»
When multiple agents are in a shared environment, there usually exist constraints among the possible actions of these agents. A distributed constraint satisfaction problem (distrib...
211 views 103 votes 15 years 8 months ago  SARA 2009»
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
91 views 111 votes 15 years 7 months ago  ECML 2005»
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
149 views 89 votes 15 years 7 months ago  SAC 2005»
In this paper, we propose an extension of three incomplete depthfirst search techniques, namely depth-bounded backtrack search, credit search, and iterative broadening, towards pr...
116 views 126 votes 14 years 12 months ago  JACM 2010»
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
106 views 101 votes 15 years 8 months ago  ICTAI 2008»
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
127 views 85 votes 15 years 7 months ago  CEC 2005»
We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component t...
122 views 100 votes 15 years 7 months ago  CPAIOR 2007»
Abstract. In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its nam...
151 views 129 votes 14 years 11 months ago  ICPPW 2009»
In this paper we address the problem of global real-time periodic scheduling on heterogeneous multiprocessor platforms. We give a solution based on a constraint satisfaction proble...