Sciweavers

425 search results - page 65 / 85
» A Fully Dynamic Algorithm for Distributed Shortest Paths
Sort
View
SPAA
2003
ACM
14 years 24 days ago
On local algorithms for topology control and routing in ad hoc networks
An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any fixed infrastructure. Indeed, an important task of an ad hoc network...
Lujun Jia, Rajmohan Rajaraman, Christian Scheidele...
GIS
2008
ACM
13 years 7 months ago
An ACS cooperative learning approach for route finding in natural environment
This paper introduces an ant-based colony system for the representation of a verbal route description. It is grounded on a natural metaphor that mimics the behavior of ant colonie...
David Brosset, Christophe Claramunt, Eric Saux
COREGRID
2007
Springer
14 years 1 months ago
Optimal Closest Policy with Qos and Bandwidth Constraints
This paper deals with the replica placement problem on fully homogeneous tree networksknownasthe Replica Placementoptimizationproblem. Theclient requests are known beforehand, whil...
Veronika Rehn-Sonigo
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 2 months ago
Nonuniform Coverage Control on the Line
Abstract— This paper investigates control laws allowing mobile, autonomous agents to optimally position themselves on the line for distributed sensing in a nonuniform field. We ...
Naomi Ehrich Leonard, Alexander Olshevsky
RAS
2006
138views more  RAS 2006»
13 years 7 months ago
From pixels to multi-robot decision-making: A study in uncertainty
Mobile robots must cope with uncertainty from many sources along the path from interpreting raw sensor inputs to behavior selection to execution of the resulting primitive actions...
Peter Stone, Mohan Sridharan, Daniel Stronger, Gre...