419 search results - page 35 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
PPSN
1998
Springer
14 years 21 days ago
1998
Springer
Many optimization problems require the satisfaction of constraints in addition to their objectives. When using an evolutionary algorithm to solve such problems, these constraints c...
CP
2009
Springer
14 years 9 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
FLAIRS
2007
13 years 10 months ago
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...
CSCLP
2004
Springer
14 years 1 months ago
2004
Springer
We consider Distributed Constraint Satisfaction Problems (DisCSP) when control of variables and constraints is distributed among a set of agents. This paper presents a distributed ...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
LP relaxation approach to soft constraint optimisation (i.e. MAP-MRF) has been mostly considered only for binary problems. We present its generalisation to n-ary problems, includi...