Sciweavers

4411 search results - page 757 / 883
» Communication Complexity and Its Applications
Sort
View
CRYPTO
2001
Springer
111views Cryptology» more  CRYPTO 2001»
15 years 9 months ago
On the Cost of Reconstructing a Secret, or VSS with Optimal Reconstruction Phase
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...
Ronald Cramer, Ivan Damgård, Serge Fehr
AGENTS
1999
Springer
15 years 9 months ago
Exception Handling in Agent Systems
A critical challenge to creating effective agent-based systems is allowing them to operate effectively when the operating environment is complex, dynamic, and error-prone. In this...
Mark Klein, Chrysanthos Dellarocas
133
Voted
AGENTS
1999
Springer
15 years 9 months ago
Team-Partitioned, Opaque-Transition Reinforcement Learning
In this paper, we present a novel multi-agent learning paradigm called team-partitioned, opaque-transition reinforcement learning (TPOT-RL). TPOT-RL introduces the concept of usin...
Peter Stone, Manuela M. Veloso
COMPSAC
1998
IEEE
15 years 9 months ago
Allocating Data Objects to Multiple Sites for Fast Browsing of Hypermedia Documents
Many world wide web applications require access, transfer, and synchronization of large multimedia data objects (MDOs) (such as, audio, video, and images) across the communication...
Siu-Kai So, Ishfaq Ahmad, Kamalakar Karlapalem
IPSN
2010
Springer
15 years 9 months ago
Practical modeling and prediction of radio coverage of indoor sensor networks
The robust operation of many sensor network applications depends on deploying relays to ensure wireless coverage. Radio mapping aims to predict network coverage based on a small n...
Octav Chipara, Gregory Hackmann, Chenyang Lu, Will...