2084 search results - page 362 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
INFOCOM
2007
IEEE
15 years 4 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
SIROCCO
2008
14 years 11 months ago
2008
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
TCAD
2008
14 years 9 months ago
2008
We present an efficient optimization scheme for gate sizing in the presence of process variations. Our method is a worst-case design scheme, but it reduces the pessimism involved i...
111
click to vote
COMGEO
2012
ACM
13 years 5 months ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
NOSSDAV
2009
Springer
15 years 4 months ago
2009
Springer
This article proposes a new distributed architecture for update message exchange in massively multi-user virtual environments (MMVE). MMVE applications require delivery of updates...