2126 search results - page 110 / 426 » An optimization algorithm for imprecise multi-objective prob... |
136
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
158
click to vote
ICCV
2005
IEEE
16 years 6 months ago
2005
IEEE
Geometric reconstruction problems in computer vision are often solved by minimizing a cost function that combines the reprojection errors in the 2D images. In this paper, we show t...
156
click to vote
ESCIENCE
2006
IEEE
15 years 10 months ago
2006
IEEE
Most Ant Colony Optimization (ACO) algorithms are able to find a single (or few) optimal, or near-optimal, solutions to difficult (NP-hard) problems. An issue though is that a s...
126
click to vote
MICAI
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a particle swarm optimizer for solving constrained optimization problems which adopts a very small population size (five particles). The proposed approach uses...
142
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Let f be a univariate polynomial with real coefficients, f ∈ R[X]. Subdivision algorithms based on algebraic techniques (e.g., Sturm or Descartes methods) are widely used for is...