75 search results - page 12 / 15 » Local Search for the Maximum Parsimony Problem |
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
We propose an efficient method for complex optimization problems that often arise in computer vision. While our method is general and could be applied to various tasks, it was mai...
AAAI
1998
13 years 8 months ago
1998
The problem of concurrent mapping and localization has received considerable attention in the mobile robotics community. Existing approachescan largely be grouped into two distinc...
TCAD
2002
13 years 7 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
IJON
2007
13 years 7 months ago
2007
The blind source separation (BSS) problem is often solved by maximizing objective functions reflecting the statistical independence between outputs. Since global maximization may...
AAAI
2008
13 years 9 months ago
2008
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...