Sciweavers

3229 search results - page 566 / 646
» The Theory of Timed Automata
Sort
View
PODC
2005
ACM
14 years 3 months ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
14 years 3 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
ATAL
2005
Springer
14 years 3 months ago
Task inference and distributed task management in the Centibots robotic system
We describe a very large scale distributed robotic system, involving a team of over 100 robots, that has been successfully deployed in large, unknown indoor environments, over ext...
Charlie Ortiz, Régis Vincent, Benoit Moriss...
LOCA
2005
Springer
14 years 3 months ago
Classifying the Mobility of Users and the Popularity of Access Points
Abstract. There is increasing interest in location-aware systems and applications. It is important for any designer of such systems and applications to understand the nature of use...
Minkyong Kim, David Kotz
MOBICOM
2004
ACM
14 years 3 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh