3533 search results - page 168 / 707 » Locally Optimized RANSAC |
183
click to vote
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
— As there are many good optimization algorithms each with its own characteristics, it is very difficult to choose the best method for optimization problems. Thus, it is importa...
160
click to vote
WSC
2004
15 years 7 months ago
2004
We present a new random search method for solving simulation optimization problems. Our approach emphasizes the need for maintaining the right balance between exploration and expl...
161
click to vote
LCPC
2000
Springer
15 years 10 months ago
2000
Springer
In translating HPF programs, a compiler has to generate local iteration and communication sets. Apart from local enumeration, local storage compression is an issue, because in HPF ...
177
click to vote
WADS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract We show that if one can find the optimal value of an integer programming problem min{cx : Ax ≥ b, x ∈ Zn +} in polynomial time, then one can find an optimal solution...
149
click to vote
ESA
2005
Springer
16 years 17 hour ago
2005
Springer
The number of probes needed by the best possible algorithm for locally or globally optimizing a bivariate function varies substantially depending on the assumptions made about the ...