Sciweavers

44 search results - page 5 / 9
» Maximum thick paths in static and dynamic environments
Sort
View
ADHOC
2007
126views more  ADHOC 2007»
14 years 9 months ago
Energy-aware routing in sensor networks: A large system approach
In many sensor networking environments, the sensor nodes have limited battery capacity and processing power. Hence, it is imperative to develop solutions that are energy-efficient...
Longbi Lin, Ness B. Shroff, R. Srikant
ATAL
2008
Springer
14 years 11 months ago
A new approach to cooperative pathfinding
In the multi-agent pathfinding problem, groups of agents need to plan paths between their respective start and goal locations in a given environment, usually a two-dimensional map...
M. Renee Jansen, Nathan R. Sturtevant
CCGRID
2007
IEEE
15 years 3 months ago
Study of Different Replica Placement and Maintenance Strategies in Data Grid
Data replication is an excellent technique to move and cache data close to users. By replication, data access performance can be improved dramatically. One of the challenges in da...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
CORR
2010
Springer
189views Education» more  CORR 2010»
14 years 9 months ago
An Optimal Dynamic Mechanism for Multi-Armed Bandit Processes
We consider the problem of revenue-optimal dynamic mechanism design in settings where agents' types evolve over time as a function of their (both public and private) experien...
Sham M. Kakade, Ilan Lobel, Hamid Nazerzadeh
CN
2010
183views more  CN 2010»
14 years 9 months ago
A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks
The dynamic point coverage problem in wireless sensor networks is to detect some moving target points in the area of the network using as little sensor nodes as possible. One way ...
Mehdi Esnaashari, Mohammad Reza Meybodi