Sciweavers

630 search results - page 63 / 126
» Hardness results for approximating the bandwidth
Sort
View
148
Voted
WINE
2010
Springer
220views Economy» more  WINE 2010»
14 years 10 months ago
Threshold Models for Competitive Influence in Social Networks
The problem of influence maximization deals with choosing the optimal set of nodes in a social network so as to maximize the resulting spread of a technology (opinion, productowne...
Allan Borodin, Yuval Filmus, Joel Oren
DAC
2009
ACM
15 years 5 months ago
Vicis: a reliable network for unreliable silicon
Process scaling has given designers billions of transistors to work with. As feature sizes near the atomic scale, extensive variation and wearout inevitably make margining unecono...
David Fick, Andrew DeOrio, Jin Hu, Valeria Bertacc...
IPTPS
2005
Springer
15 years 6 months ago
Clustering in P2P Exchanges and Consequences on Performances
— We propose here an analysis of a rich dataset which gives an exhaustive and dynamic view of the exchanges processed in a running eDonkey system. We focus on correlation in term...
Stevens Le-Blond, Jean-Loup Guillaume, Matthieu La...
85
Voted
IEICET
2007
73views more  IEICET 2007»
15 years 16 days ago
An ON-OFF Multi-Rate Loss Model of Finite Sources
Bursty traffic is dominant in modern communication networks and keeps the call-level QoS assessment an open issue. ON-OFF traffic models are commonly used to describe bursty tra...
Ioannis D. Moscholios, Michael D. Logothetis, Mich...
113
Voted
ICNP
2006
IEEE
15 years 6 months ago
Rigorous Protocol Design in Practice: An Optical Packet-Switch MAC in HOL
— This paper reports on an experiment in network protocol design: we use novel rigorous techniques in the design process of a new protocol, in a close collaboration between syste...
Adam Biltcliffe, Michael Dales, Sam Jansen, Tom Ri...