Sciweavers

1257 search results - page 240 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
IPPS
2009
IEEE
15 years 4 months ago
A resource allocation approach for supporting time-critical applications in grid environments
— There are many grid-based applications where a timely response to an important event is needed. Often such response can require a significant computation and possibly communic...
Qian Zhu, Gagan Agrawal
INFOCOM
2008
IEEE
15 years 4 months ago
Feasible Rate Allocation in Wireless Networks
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
Ramakrishna Gummadi, Kyomin Jung, Devavrat Shah, R...
DATE
2004
IEEE
144views Hardware» more  DATE 2004»
15 years 1 months ago
A Framework for Battery-Aware Sensor Management
A distributed sensor network (DSN) designed to cover a given region R, is said to be alive if there is at least one subset of sensors that can collectively cover (sense) the regio...
Sridhar Dasika, Sarma B. K. Vrudhula, Kaviraj Chop...
IWQOS
2001
Springer
15 years 2 months ago
Dynamic Core Provisioning for Quantitative Differentiated Service
— Efficient network provisioning mechanisms that support service differentiation and automatic capacity dimensioning are essential to the realization of the Differentiated Servi...
Raymond R.-F. Liao, Andrew T. Campbell
GLOBECOM
2007
IEEE
15 years 4 months ago
Beamforming with Limited Feedback in Amplify-and-Forward Cooperative Networks
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...
Yi Zhao, Raviraj Adve, Teng Joon Lim