Sciweavers

7133 search results - page 82 / 1427
» Communication algorithms with advice
Sort
View
PERCOM
2010
ACM
13 years 3 months ago
Local map generation using position and communication history of mobile nodes
In this paper, we propose an algorithm to estimate 2D shapes and positions of obstacles such as buildings using GPS and wireless communication history of mobile nodes. Our algorith...
Shinichi Minamimoto, Sae Fujii, Hirozumi Yamaguchi...
ISCIS
2003
Springer
14 years 2 months ago
Design and Implementation of a Secure Group Communication Protocol on a Fault Tolerant Ring
In this paper, we describe a secure group communication protocol for a fault-tolerant synchronous ring. Our protocol, named Secure Synchronous Ring Protocol (SSRP), integrates a se...
Özgür Saglam, Mehmet E. Dalkilç, ...
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
14 years 1 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf
ICML
2004
IEEE
14 years 9 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
IPPS
2007
IEEE
14 years 3 months ago
Dynamic Load-Balancing and High Performance Communication in Jcluster
This paper describes the dynamic load-balancing and high performance communication provided in Jcluster, an efficient Java parallel environment. For the efficient loadbalancing,...
Bao-Yin Zhang, Zeyao Mo, Guangwen Yang, Weimin Zhe...