749 search results - page 33 / 150 » Dualities for Constraint Satisfaction Problems |
101
click to vote
JGO
2010
14 years 11 months ago
2010
We consider a generalized equilibrium problem involving DC functions which is called (GEP). For this problem we establish two new dual formulations based on Toland-Fenchel-Lagrange...
120
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
132
Voted
ACST
2006
15 years 1 months ago
2006
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
127
Voted
AISC
2004
Springer
15 years 6 months ago
2004
Springer
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
94
Voted
AAAI
1996
15 years 1 months ago
1996
A team of constraint agents with diverse viewpoints canfind a solution to a constraint satisfaction problem (CSP) whenthe individual agents have an incomplete viewof the problem.I...