Sciweavers

58 search results - page 12 / 12
» Critical path analysis using a dynamically bounded delay mod...
Sort
View
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 9 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
SECON
2007
IEEE
13 years 11 months ago
The Optimum Number of OSPF Areas for MANETs
—Mobile ad hoc networks (MANETs) are a critical technology in filling the gap where the network infrastructure is insufficient or does not exist at all. The dynamic topology of...
Jangeun Jun, Mihail L. Sichitiu, Hector D. Flores,...
MOBICOM
2012
ACM
11 years 7 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...