242 search results - page 31 / 49 » Distributed algorithms with dynamical random transitions |
106
Voted
MOBIHOC
2009
ACM
16 years 3 months ago
2009
ACM
Routing is one of the most challenging open problems in disruption-tolerant networks (DTNs) because of the shortlived wireless connectivity environment. To deal with this issue, r...
118
Voted
JSAC
2008
15 years 2 months ago
2008
In this paper, we generalize the random access game model, and show that it provides a general game-theoretic framework for designing contention based medium access control. We ext...
141
Voted
SIGSOFT
1994
ACM
15 years 6 months ago
1994
ACM
Program slicing is a fundamental operation for many software engineering tools. Currently, the most efficient algorithm for interprocedural slicing is one that uses a program repr...
225
Voted
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
124
Voted
COOPIS
2003
IEEE
15 years 7 months ago
2003
IEEE
Abstract. Asynchronous communications are prominent in distributed and mobile systems. Often consystems consider an abstract point of view with synchronous communications. However ...