Sciweavers

2924 search results - page 220 / 585
» Lower Bounds in Distributed Computing
Sort
View
CIE
2007
Springer
16 years 1 months ago
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
Michael R. Fellows, Frances A. Rosamond
LADC
2005
Springer
16 years 9 days ago
Timed Asynchronous Distributed Systems
We present a framework for building fail-safe hard real-time applications in timed asynchronous distributed systems subject to communication partitions and performance, omission, ...
Christof Fetzer
CONCUR
2010
Springer
15 years 8 months ago
Buffered Communication Analysis in Distributed Multiparty Sessions
Many communication-centred systems today rely on asynchronous messaging among distributed peers to make efficient use of parallel execution and resource access. With such asynchron...
Pierre-Malo Deniélou, Nobuko Yoshida
ATAL
2005
Springer
16 years 10 days ago
Exploiting belief bounds: practical POMDPs for personal assistant agents
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
Pradeep Varakantham, Rajiv T. Maheswaran, Milind T...
ICPP
2003
IEEE
16 years 2 days ago
Quorum-Based Asynchronous Power-Saving Protocols for IEEE 802.11 Ad Hoc Networks
This paper investigates the power mode management problem for an IEEE 802.11-based mobile ad hoc network (MANET) that allows mobile hosts to tune to the power-saving (PS) mode. The...
Jehn-Ruey Jiang, Yu-Chee Tseng, Chih-Shun Hsu, Ten...