Sciweavers

1434 search results - page 106 / 287
» Distributed Computing with Imperfect Randomness
Sort
View
CISS
2007
IEEE
14 years 4 months ago
A High-Throughput Cross-Layer Scheme for Distributed Wireless Ad Hoc Networks
— In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Oc...
Athina P. Petropulu, Lun Dong, H. Vincent Poor
DCOSS
2005
Springer
14 years 3 months ago
A Distributed Greedy Algorithm for Connected Sensor Cover in Dense Sensor Networks
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
Amitabha Ghosh, Sajal K. Das
PE
2010
Springer
170views Optimization» more  PE 2010»
13 years 8 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
EOR
2011
134views more  EOR 2011»
13 years 5 months ago
Linear programming based decomposition methods for inventory distribution systems
We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse ...
Sumit Kunnumkal, Huseyin Topaloglu
IPPS
2006
IEEE
14 years 4 months ago
Algorithm-based checkpoint-free fault tolerance for parallel matrix computations on volatile resources
As the desire of scientists to perform ever larger computations drives the size of today’s high performance computers from hundreds, to thousands, and even tens of thousands of ...
Zizhong Chen, Jack Dongarra