Sciweavers

515 search results - page 18 / 103
» Classroom Examples of Robustness Problems in Geometric Compu...
Sort
View
ATAL
2008
Springer
14 years 11 months ago
Automated global-to-local programming in 1-D spatial multi-agent systems
A spatial computer is a distributed multi-agent system that is embedded in a geometric space. A key challenge is engineering local agent interaction rules that enable spatial comp...
Daniel Yamins, Radhika Nagpal
CCR
2006
117views more  CCR 2006»
14 years 9 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav
IJRR
2002
92views more  IJRR 2002»
14 years 9 months ago
On Fitted Stratified and Semi-Stratified Geometric Manipulation Planning with Fingertip Relocations
This paper presents two object manipulation planning methods based on fitted stratified and semi-stratified approaches using finger relocations. The problem is discussed in the fr...
István Harmati, Béla Lantos, Shahram...
ICCV
2009
IEEE
14 years 7 months ago
Exploiting uncertainty in random sample consensus
In this work, we present a technique for robust estimation, which by explicitly incorporating the inherent uncertainty of the estimation procedure, results in a more efficient rob...
Rahul Raguram, Jan-Michael Frahm, Marc Pollefeys
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
15 years 4 months ago
On the runtime analysis of the 1-ANT ACO algorithm
The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. These results, however, apply pa...
Benjamin Doerr, Frank Neumann, Dirk Sudholt, Carst...