Sciweavers

1220 search results - page 89 / 244
» Minimal Interval Completions
Sort
View
SC
2009
ACM
14 years 4 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
ICC
2009
IEEE
165views Communications» more  ICC 2009»
14 years 4 months ago
Arbitrarily Tight Upper and Lower Bounds on the Gaussian Q-Function and Related Functions
—We present a new family of tight lower and upper bounds on the Gaussian Q-function Q(x). It is first shown that, for any x, the integrand ϕ(θ; x) of the Craig representation ...
Giuseppe Thadeu Freitas de Abreu
VTC
2007
IEEE
14 years 3 months ago
Using Shared Beacon Channel for Fast Handoff in IEEE 802.11 Wireless Networks
— Handoff process in IEEE 802.11 wireless networks must be accomplished with as little interruption as possible to maintain the required quality of service (QoS). Previous resear...
Jaeouk Ok, Pedro Morales, Andreas Darmawan, Hiroyu...
HPCC
2007
Springer
14 years 3 months ago
Online Algorithms for Single Machine Schedulers to Support Advance Reservations from Grid Jobs
Advance Reservations(AR) make it possible to guarantee the QoS of Grid applications by reserving a particular resource capability over a defined time interval on local resources. H...
Bo Li, Dongfeng Zhao
AICT
2006
IEEE
14 years 3 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...