Sciweavers

2084 search results - page 414 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
ATAL
2009
Springer
14 years 1 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
INFOCOM
2005
IEEE
14 years 29 days ago
CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming
— This paper presents DONet, a Data-driven Overlay Network for live media streaming. The core operations in DONet are very simple: every node periodically exchanges data availabi...
Xinyan Zhang, Jiangchuan Liu, Bo Li, Tak-Shing Pet...
SCP
2010
155views more  SCP 2010»
13 years 5 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
SECON
2007
IEEE
14 years 1 months ago
Coverage Problem for Sensors Embedded in Temperature Sensitive Environments
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
Arunabha Sen, Nibedita Das, Ling Zhou, Bao Hong Sh...
EDBT
2010
ACM
152views Database» more  EDBT 2010»
13 years 10 months ago
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...