Sciweavers

408 search results - page 36 / 82
» Network laws
Sort
View
JCT
2011
78views more  JCT 2011»
13 years 4 months ago
The Max-Flow Min-Cut theorem for countable networks
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to e...
Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Am...
TON
2010
118views more  TON 2010»
13 years 4 months ago
Capacity Scaling of Wireless Networks With Inhomogeneous Node Density: Lower Bounds
Abstract-- We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area, and analyze the scaling laws of their ...
Giusi Alfano, Michele Garetto, Emilio Leonardi, Va...
ODR
2008
13 years 11 months ago
Re-Consider: The Integration of Online Dispute Resolution and Decision Support Systems
Current approaches for the design of Online Dispute Resolution (ODR) systems involve the replication of Alternative Dispute Resolution practices such as mediation and negotiation. ...
Nial Muecke, Andrew Stranieri, Charlynn Miller
IPPS
2007
IEEE
14 years 4 months ago
PON: Exploiting Proximity on Overlay Networks
We define a proximity overlay network (PON) which allow to realize DHT systems whose aim is to combine routing efficiency – i.e. an optimal degree/diameter tradeoff – and pr...
Gennaro Cordasco, Alberto Negro, Alessandra Sala, ...
EWSN
2012
Springer
12 years 5 months ago
Low Power or High Performance? A Tradeoff Whose Time Has Come (and Nearly Gone)
Abstract. Some have argued that the dichotomy between high-performance operation and low resource utilization is false – an artifact that will soon succumb to Moore’s Law and c...
JeongGil Ko, Kevin Klues, Christian Richter, Wanja...