Sciweavers

1754 search results - page 50 / 351
» The Computational Complexity of Delay Management
Sort
View
OPODIS
2003
15 years 1 months ago
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems
A fundamental problem in distributed computing is performing a set despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processor...
Dariusz R. Kowalski, Mariam Momenzadeh, Alexander ...
CN
2006
82views more  CN 2006»
14 years 12 months ago
A cost-minimization algorithm for fast location tracking in mobile wireless networks
Location tracking is one of the most important issues in providing real-time applications over wireless networks due to its effect to quality of service (QoS), such as end-to-end ...
Wenye Wang, Guoliang Xue
DAC
2005
ACM
16 years 24 days ago
Power optimal dual-Vdd buffered tree considering buffer stations and blockages
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
King Ho Tam, Lei He
PERCOM
2008
ACM
15 years 11 months ago
SGR: A Shared Generic Routing Support for Ad Hoc Ubiquitous Computing Environments
One of the most evident characteristics of an ad hoc ubiquitous computing environment is the dynamism of connections. Due to the mobility of nodes, paths between communicating pee...
Yangwoo Ko, Dongman Lee
WORDS
2005
IEEE
15 years 5 months ago
A Framework for Middleware Supporting Real-Time Wide-Area Distributed Computing
: The development of real-time systems that are distributed over a wide area is a significant problem that has challenged researchers for many years. Such systems require precise t...
K. H. (Kane) Kim, Stephen F. Jenks, Larry Smarr, A...