3533 search results - page 71 / 707 » Locally Optimized RANSAC |
168
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
We consider complex scheduling problems that can be captured as optimization under hard and soft constraints. The objective of such an optimization problem is to satisfy as many h...
141
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Although multi-objective GA (MOGA) is an efficient multiobjective optimization (MOO) method, it has some limitations that need to be tackled, which include unguaranteed uniformity...
178
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
172
click to vote
AAAI
2006
15 years 7 months ago
2006
Learning application-specific distance metrics from labeled data is critical for both statistical classification and information retrieval. Most of the earlier work in this area h...
167
click to vote
SCHEDULING
2008
15 years 5 months ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...