1483 search results - page 90 / 297 » Geometric constraint satisfaction using optimization methods |
126
click to vote
ECCV
2010
Springer
15 years 6 months ago
2010
Springer
Since most current scene understanding approaches operate
either on the 2D image or using a surface-based representation, they do
not allow reasoning about the physical constrain...
108
click to vote
NHM
2010
14 years 8 months ago
2010
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
103
click to vote
CP
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had...
129
click to vote
CSCLP
2006
Springer
15 years 5 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...