Sciweavers

2714 search results - page 134 / 543
» Approximation Schemes for Scheduling
Sort
View
98
Voted
DMIN
2006
115views Data Mining» more  DMIN 2006»
15 years 2 months ago
Indexing Spatio-Temporal Trajectories with Orthogonal Polynomials
Abstract-- In this paper we consider d-dimensional spatiotemporal data (d 1) and ways to approximate and index it. We focus on indexing such data for similarity matching using orth...
Elena Braynova
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 7 months ago
Channel Access Statistics of Parallel Multiuser Scheduling
— Generalized selection multiuser diversity (GSMuD) is a new scheduling scheme which provides a near-optimal low-complexity solution to parallel access multiuser scheduling. In t...
Yao Ma, Dongbo Zhang
152
Voted
ICESS
2007
Springer
15 years 6 months ago
Sleep Nodes Scheduling in Cluster-Based Heterogeneous Sensor Networks Using AHP
Abstract. Wireless sensor networks (WSNs) are comprised of energy constrained nodes. This limitation has led to the crucial need for energy-aware protocols to produce an efficient ...
Xiaoling Wu, Jinsung Cho, Brian J. d'Auriol, Sungy...
109
Voted
AVSS
2006
IEEE
15 years 6 months ago
Optimal Power Scheduling for Data Fusion in Inhomogeneous Wireless Sensor Networks
We consider the problem of optimal power scheduling for the decentralized detection of a deterministic signal in an inhomogeneous wireless sensor network. The observation noise at...
Thakshila Wimalajeewa, Sudharman K. Jayaweera
ICPP
2002
IEEE
15 years 5 months ago
Power Aware Scheduling for AND/OR Graphs in Multi-Processor Real-Time Systems
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
Dakai Zhu, Nevine AbouGhazaleh, Daniel Mossé...