Sciweavers

1718 search results - page 181 / 344
» Communicating more than nothing
Sort
View
155
Voted
ATAL
2006
Springer
15 years 9 months ago
No-commitment branch and bound search for distributed constraint optimization
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...
Anton Chechetka, Katia P. Sycara
CAAN
2006
Springer
15 years 9 months ago
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks
Gossiping is a communication primitive where each node of a network possesses a unique message that is to be communicated to all other nodes in the network. We study the gossiping ...
Fredrik Manne, Qin Xin
SIGCOMM
1995
ACM
15 years 9 months ago
Performance Analysis of MD5
MD5 is an authentication algorithm proposed as the required implementation of the authentication option in IPv6. This paper presents an analysis of the speed at which MD5 can be i...
Joseph D. Touch
GLOBECOM
2007
IEEE
15 years 7 months ago
A SAGE Algorithm for Estimation of the Direction Power Spectrum of Individual Path Components
—In this contribution, the Fisher-Bingham-5 (FB5) probability density function (pdf) is used to model the shape of the direction power spectral density function (psdf) of individ...
Xuefeng Yin, Lingfeng Liu, Daniel K. Nielsen, Troe...
ICC
2007
IEEE
186views Communications» more  ICC 2007»
15 years 7 months ago
On Channel Coding Selection in Time-Slotted ALOHA Packetized Multiple-Access Systems Over Rayleigh Fading Channels
— In this paper, we consider the time-slotted ALOHA packetized multiple-access system where the transmission channels obey i.i.d (independent identically distributed) Rayleigh fa...
Chen Wei, Pingyi Fan, Khaled Ben Letaief