Sciweavers

717 search results - page 20 / 72
» Weak-Commitment Search for Solving Constraint Satisfaction P...
Sort
View
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...
101 views 137 votes 15 years 2 months ago  AAAI 2006»
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
141 views 111 votes 15 years 6 months ago  IBERAMIA 2004»
Abstract. In constraint satisfaction, a general rule is to tackle the hardest part of a search problem first. In this paper, we introduce a parameter (τ) that measures the constr...
111 views 112 votes 15 years 5 months ago  EVOW 2006»
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
122 views 93 votes 15 years 3 months ago  FLAIRS 2007»
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
92 views 104 votes 15 years 6 months ago  CP 2004»
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...