3758 search results - page 289 / 752 » A Complete Subsumption Algorithm |
187
click to vote
CPC
2007
15 years 6 months ago
2007
Abstract. This paper is devoted to an online variant of the minimum spanning tree problem in randomly weighted graphs. We assume that the input graph is complete and the edge weigh...
160
click to vote
JACM
2006
15 years 6 months ago
2006
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
223
click to vote
TEC
2002
15 years 6 months ago
2002
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
175
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
182
click to vote
ICRA
2009
IEEE
15 years 4 months ago
2009
IEEE
When operating in partially-known environments, autonomous vehicles must constantly update their maps and plans based on new sensor information. Much focus has been placed on devel...