350 search results - page 49 / 70 » Lower and upper bounds on obtaining history independence |
ICC
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...
114
click to vote
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— We consider a collocated wireless network where all links contend for a given channel and each link can hear others’ transmissions. Due to channel fading, the link condition ...
ICC
1997
IEEE
15 years 4 months ago
1997
IEEE
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
ICCAD
1996
IEEE
15 years 4 months ago
1996
IEEE
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...