Sciweavers

199 search results - page 5 / 40
» Randomised Individual Communication Complexity
Sort
View
IPSN
2005
Springer
14 years 29 days ago
Coverage and hole-detection in sensor networks via homology
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
Robert Ghrist, Abubakr Muhammad
HICSS
2009
IEEE
130views Biometrics» more  HICSS 2009»
14 years 2 months ago
A Systematic Approach to Improve Communication for Emergency Response
The importance of communication, information sharing and interoperability in an emergency response scenario have risen recently based on the frequency of disasters throughout the ...
Raheleh B. Dilmaghani, Ramesh R. Rao
JAIR
2008
145views more  JAIR 2008»
13 years 7 months ago
Communication-Based Decomposition Mechanisms for Decentralized MDPs
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
Claudia V. Goldman, Shlomo Zilberstein
PIMRC
2008
IEEE
14 years 1 months ago
Limited feedback for multi-antenna multi-user communications with Generalized Multi-Unitary Decomposition
– In this paper, we propose a decomposition method called Generalized Multi-Unitary Decomposition (GMUD) which is useful in multi-user MIMO precoding. This decomposition transfor...
Wee Seng Chua, Chau Yuen, Yong Liang Guan, Francoi...
CLIMA
2004
13 years 8 months ago
Verifying Protocol Conformance for Logic-Based Communicating Agents
Communication plays a fundamental role in multi-agents systems. One of the main issues in the design of agent interaction protocols is the verification that a given protocol implem...
Matteo Baldoni, Cristina Baroglio, Alberto Martell...