559 search results - page 70 / 112 » Fast SDP Algorithms for Constraint Satisfaction Problems |
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
The Shape-from-Shading [SfS] problem infers shape from reflected light, collected using a camera at a single point in space only. Reflected light alone does not provide sufficient ...
DATE
2002
IEEE
14 years 21 days ago
2002
IEEE
The oscillator problem consists of determining good initial values for the node voltages and the frequency of oscillation and the avoidance of the DC solution. Standard approaches...
ICLP
2004
Springer
14 years 1 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
SAS
2001
Springer
14 years 4 days ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...
JAIR
2008
13 years 7 months ago
2008
Asynchronous Partial Overlay (APO) is a search algorithm that uses cooperative mediation to solve Distributed Constraint Satisfaction Problems (DisCSPs). The algorithm partitions ...