Sciweavers

1497 search results - page 51 / 300
» A Computational Model for Message Passing
Sort
View
PODC
1991
ACM
14 years 21 days ago
Resource Bounds for Self Stabilizing Message Driven Protocols
Abstract. Self-stabilizing message driven protocols are deļ¬ned and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is deļ...
Shlomi Dolev, Amos Israeli, Shlomo Moran
LCPC
2005
Springer
14 years 2 months ago
Code Transformations for One-Pass Analysis
With the growing popularity of streaming data model, processing queries over streaming data has become an important topic. Streaming data has received attention in a number of comm...
Xiaogang Li, Gagan Agrawal
ICARCV
2002
IEEE
185views Robotics» more  ICARCV 2002»
14 years 2 months ago
Evolving cooperative robotic behaviour using distributed genetic programming
Cooperative robotic systems provide design and implementation challenges that are not easy to solve. This paper describes a parallel implementation for evolving cooperative roboti...
Chris H. Messom, Matthew G. Walker
IPL
2006
104views more  IPL 2006»
13 years 9 months ago
The communication complexity of the Hamming distance problem
We investigate the randomized and quantum communication complexity of the HAMMING DISTANCE problem, which is to determine if the Hamming distance between two n-bit strings is no l...
Wei Huang, Yaoyun Shi, Shengyu Zhang, Yufan Zhu
TACAS
2001
Springer
119views Algorithms» more  TACAS 2001»
14 years 1 months ago
Compositional Message Sequence Charts
Abstract. A message sequence chart (MSC) is a standard notation for describing the interaction between communicating objects. It is popular among the designers of communication pro...
Elsa L. Gunter, Anca Muscholl, Doron Peled