Sciweavers

808 search results - page 5 / 162
» A scaling algorithm for polynomial constraint satisfaction p...
Sort
View
ECSQARU
2007
Springer
14 years 1 months ago
Algebraic Structures for Bipolar Constraint-Based Reasoning
The representation of both scales of cost and scales of benefit is very natural in a decision-making problem: scales of evaluation of decisions are often bipolar. The aim of this ...
Hélène Fargier, Nic Wilson
AIR
2005
111views more  AIR 2005»
13 years 7 months ago
An Arc-Consistency Algorithm for Dynamic and Distributed Constraint Satisfaction Problems
Abstract. This paper presents the new DDAC4 algorithm for dynamic arc consistency enforcement in distributed Constraint Satisfaction Problems. The algorithm is an adaptation of the...
Georg Ringwelski
ECML
2005
Springer
14 years 26 days ago
A SAT-Based Version Space Algorithm for Acquiring Constraint Satisfaction Problems
Constraint programming is rapidly becoming the technology of choice for modelling and solving complex combinatorial problems. However, users of this technology need significant ex...
Christian Bessière, Remi Coletta, Fré...
JAIR
2006
131views more  JAIR 2006»
13 years 7 months ago
Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
Roger Mailler, Victor R. Lesser
AICOM
2004
92views more  AICOM 2004»
13 years 7 months ago
An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
Berthe Y. Choueiry, Lin Xu