150 search results - page 27 / 30 » Solving Permutation Constraint Satisfaction Problems with Ar... |
105
click to vote
SAC
2006
ACM
14 years 9 months ago
2006
ACM
Interactive configuration guides a user searching through a large combinatorial space of solutions to a system of constraints. We investigate a class of very expressive underlying...
CP
2006
Springer
15 years 1 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
96
Voted
ECAI
2004
Springer
15 years 1 months ago
2004
Springer
Quantified Constraint Satisfaction Problems (QCSPs) are CSPs in which some variables are universally quantified. For each possible value of such variables, we have to find ways to ...
87
Voted
CSCLP
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
AI
2010
Springer
14 years 9 months ago
2010
Springer
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...