Sciweavers

1691 search results - page 307 / 339
» The Delayed k-Server Problem
Sort
View
INTEGRATION
2006
82views more  INTEGRATION 2006»
13 years 8 months ago
On whitespace and stability in physical synthesis
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible ...
Saurabh N. Adya, Igor L. Markov, Paul G. Villarrub...
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 8 months ago
Anonymous Networking amidst Eavesdroppers
—The problem of security against packet timing based traffic analysis in wireless networks is considered in this work. An analytical measure of “anonymity” of routes in eave...
Parvathinathan Venkitasubramaniam, Ting He, Lang T...
PERCOM
2008
ACM
13 years 8 months ago
P2P multicast for pervasive ad hoc networks
Integrating p2p services in multi-hop ad hoc networks is today a hot topic. General multi-hop , and pervasive systems in particular, can greatly benefit from high-level middleware...
Franca Delmastro, Andrea Passarella, Marco Conti
SIGMETRICS
2008
ACM
138views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Utility maximization in peer-to-peer systems
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Ji...
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
13 years 8 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...