1844 search results - page 59 / 369 » Exploiting the Structure of Distributed Constraint Optimizat... |
153
click to vote
COCOA
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Many combinatorial optimization problems can be formulated as 0/1 integer programs (0/1 IPs). The investigation of the structure of these problems raises the following ta...
118
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
We describe a new framework for globally solving the 3D-3D registration problem with unknown point correspondences. This problem is significant as it is frequently encountered in ...
150
click to vote
SAGA
2001
Springer
15 years 8 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
131
Voted
ISCAS
1994
IEEE
15 years 8 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
127
Voted
PPAM
2005
Springer
15 years 9 months ago
2005
Springer
We address a generalization of the classical 1- and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous av...