242 search results - page 31 / 49 » Distributed algorithms with dynamical random transitions |
MOBIHOC
2009
ACM
16 years 8 days 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...
95
Voted
JSAC
2008
14 years 11 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...
105
click to vote
SIGSOFT
1994
ACM
15 years 3 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...
SPAA
2005
ACM
15 years 5 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...
COOPIS
2003
IEEE
15 years 5 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 ...