Sciweavers

90 search results - page 18 / 18
» Capacity Regions and Bounds for a Class of Z-interference Ch...
Sort
View
UAI
2001
13 years 6 months ago
Iterative Markov Chain Monte Carlo Computation of Reference Priors and Minimax Risk
We present an iterative Markov chain Monte Carlo algorithm for computing reference priors and minimax risk for general parametric families. Our approach uses MCMC techniques based...
John D. Lafferty, Larry A. Wasserman
ICC
2007
IEEE
185views Communications» more  ICC 2007»
13 years 11 months ago
Maximal Lifetime Rate and Power Allocation for Sensor Networks with Data Distortion Constraints
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
James C. F. Li, Subhrakanti Dey, Jamie S. Evans
EURONGI
2006
Springer
13 years 8 months ago
Job Scheduling for Maximal Throughput in Autonomic Computing Systems
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
Kevin Ross, Nicholas Bambos
CORR
2006
Springer
145views Education» more  CORR 2006»
13 years 4 months ago
Product Multicommodity Flow in Wireless Networks
We provide a tight approximate characterization of the n-dimensional product multicommodity flow (PMF) region for a wireless network of n nodes. Separate characterizations in term...
Ritesh Madan, Devavrat Shah, Olivier Lév&ec...
WIOPT
2010
IEEE
13 years 2 months ago
Delay efficient scheduling via redundant constraints in multihop networks
Abstract--We consider the problem of delay-efficient scheduling in general multihop networks. While the class of max-weight type algorithms are known to be throughput optimal for t...
Longbo Huang, Michael J. Neely