838 search results - page 82 / 168 » Finding Optimal Solutions to Atomix |
108
click to vote
COCOA
2007
Springer
15 years 6 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...
127
click to vote
ISICA
2007
Springer
15 years 6 months ago
2007
Springer
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
104
click to vote
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
This paper presents a practical method for finding the provably globally optimal solution to numerous problems in projective geometry including multiview triangulation, camera rese...
140
click to vote
ICPR
2010
IEEE
15 years 6 months ago
2010
IEEE
Many vision applications have been formulated as Markov Random Field (MRF) problems. Although many of them are discrete labeling problems, continuous formulation often achieves gre...
103
click to vote
ALENEX
2009
14 years 9 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...