296 search results - page 59 / 60 » An Upper Bound on Network Size in Mobile Ad-Hoc Networks |
SIROCCO
2007
13 years 6 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
INFOCOM
2002
IEEE
13 years 10 months ago
2002
IEEE
—Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of s...
TCS
2008
13 years 5 months ago
2008
We introduce a new combinatorial game between two players: Magnus and Derek. Initially, a token is placed at position 0 on a round table with n positions. In each round of the gam...