Sciweavers

1095 search results - page 34 / 219
» Efficient Algorithms for Average Completion Time Scheduling
Sort
View
IJCAI
2001
14 years 11 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen
TMC
2012
13 years 5 days ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
INFOCOM
2005
IEEE
15 years 3 months ago
Energy optimal control for time varying wireless networks
Abstract— We develop a dynamic control strategy for minimizing energy expenditure in a time varying wireless network with adaptive transmission rates. The algorithm operates with...
Michael J. Neely
MOBICOM
1997
ACM
15 years 1 months ago
Log-Time Algorithms for Scheduling Single and Multiple Channel Data Broadcast
With the increasing popularity of portable wireless computers, mechanisms to efficiently transmit information to such clients are of significant interest. The environmentundercons...
Sohail Hameed, Nitin H. Vaidya
SUTC
2010
IEEE
15 years 1 months ago
Link Scheduling in a Single Broadcast Domain Underwater Networks
Because radio waves decay rapidly in sea water, acoustic communication is the most popular choic for underwater sensor networks. However, since the propagation speed of acoustic w...
Pai-Han Huang, Ying Chen, Bhaskar Krishnamachari, ...