Sciweavers

27 search results - page 2 / 6
» Solving weighted CSP by maintaining arc consistency
Sort
View
ICML
2007
IEEE
14 years 6 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
AAAI
2008
13 years 7 months ago
Virtual Arc Consistency for Weighted CSP
Martin C. Cooper, Simon de Givry, Martí S&a...
AI
2010
Springer
13 years 5 months ago
Soft arc consistency revisited
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
ECAI
1992
Springer
13 years 8 months ago
Arc-Consistency for Non-Binary Dynamic CSPs
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
Christian Bessière
SAT
2007
Springer
92views Hardware» more  SAT 2007»
13 years 11 months ago
Mapping CSP into Many-Valued SAT
We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and p...
Carlos Ansótegui, Maria Luisa Bonet, Jordi ...