Sciweavers

123 search results - page 13 / 25
» Computing upper and lower bounds on likelihoods in intractab...
Sort
View
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
NETWORKING
2010
13 years 8 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
FOCS
1994
IEEE
13 years 11 months ago
On-line Admission Control and Circuit Routing for High Performance Computing and Communication
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit r...
Baruch Awerbuch, Rainer Gawlick, Frank Thomson Lei...
TSP
2008
101views more  TSP 2008»
13 years 7 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami
MOBIHOC
2008
ACM
14 years 7 months ago
The capacity and energy efficiency of wireless ad hoc networks with multi-packet reception
We address the cost incurred in increasing the transport capacity of wireless ad hoc networks over what can be attained when sources and destinations communicate over multi-hop pa...
Zheng Wang, Hamid R. Sadjadpour, Jose Joaquin Garc...