3533 search results - page 434 / 707 » Locally Optimized RANSAC |
155
click to vote
EVOW
2006
Springer
15 years 9 months ago
2006
Springer
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
140
click to vote
ASPDAC
2001
ACM
15 years 9 months ago
2001
ACM
One of the most challenging issues in today's high-performance VLSI design is to ensure high-quality power supply to each individual circuit blocks. Reduced power supply volt...
181
click to vote
NGC
2000
Springer
15 years 9 months ago
2000
Springer
The use of proxies for local error recovery and congestion control is a scalable technique used to overcome a number of wellknown problems in Reliable Multicast (RM). The idea is ...
168
click to vote
SODA
2008
ACM
15 years 7 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
148
click to vote
FLAIRS
2003
15 years 7 months ago
2003
This paper presents the Incremental Breakout Algorithm with Variable Ordering (IncBA). This algorithm belongs to the class of local search algorithms for solving Constraint Satisf...