Sciweavers

1399 search results - page 274 / 280
» Multi-party Finite Computations
Sort
View
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
13 years 11 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
ATAL
2006
Springer
13 years 11 months ago
Winning back the CUP for distributed POMDPs: planning over continuous belief spaces
Distributed Partially Observable Markov Decision Problems (Distributed POMDPs) are evolving as a popular approach for modeling multiagent systems, and many different algorithms ha...
Pradeep Varakantham, Ranjit Nair, Milind Tambe, Ma...
DATE
2004
IEEE
185views Hardware» more  DATE 2004»
13 years 11 months ago
Energy-Aware System Design for Wireless Multimedia
In this paper, we present various challenges that arise in the delivery and exchange of multimedia information to mobile devices. Specifically, we focus on techniques for maintain...
Hans Van Antwerpen, Nikil D. Dutt, Rajesh K. Gupta...
DIALM
2004
ACM
161views Algorithms» more  DIALM 2004»
13 years 11 months ago
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
CCS
2006
ACM
13 years 11 months ago
Safety analysis of usage control authorization models
The usage control (UCON) model was introduced as a unified approach to capture a number of extensions for traditional access control models. While the policy specification flexibi...
Xinwen Zhang, Ravi S. Sandhu, Francesco Parisi-Pre...