Sciweavers

24 search results - page 5 / 5
» Self-stabilizing Deterministic Gathering
Sort
View
OPODIS
2008
13 years 6 months ago
Rendezvous of Mobile Agents When Tokens Fail Anytime
Abstract. We consider the problem of Rendezvous or gathering of multiple autonomous entities (called mobile agents) moving in an unlabelled environment (modelled as a graph). The p...
Shantanu Das, Matús Mihalák, Rastisl...
ISR
2010
13 years 3 months ago
Resource Allocation Policies for Personalization in Content Delivery Sites
One of the distinctive features of sites on the Internet is their ability to gather enormous amounts of information regarding their visitors, and use this information to enhance a...
Dengpan Liu, Sumit Sarkar, Chelliah Sriskandarajah
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
13 years 11 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
FOCS
1993
IEEE
13 years 9 months ago
An On-Line Algorithm for Improving Performance in Navigation
We consider the following scenario. A point robot is placed at some start location ¡ in a 2dimensional scene containing oriented rectangular obstacles. The robot must repeatedly ...
Avrim Blum, Prasad Chalasani