Sciweavers

163 search results - page 10 / 33
» Composition Theorems in Communication Complexity
Sort
View
TASE
2009
IEEE
15 years 4 months ago
State Visibility and Communication in Unifying Theories of Programming
We explore the interactions between programvariable state visibility and communication behaviour in state-rich CSP-like processes, using the Unifying Theories of Programming (UTP)...
Andrew Butterfield, Pawel Gancarski, Jim Woodcock
96
Voted
ACAL
2009
Springer
15 years 24 days ago
Towards Tailored Communication Networks in Assemblies of Artificial Cells
Abstract. Living Technology is researching novel IT making strong use of programmable chemical systems. These chemical systems shall finally converge to artificial cells resulting ...
Maik Hadorn, Bo Burla, Peter Eggenberger Hotz
IJVR
2008
134views more  IJVR 2008»
14 years 9 months ago
An Educational Virtual Scenario for Learning Chaos and Complexity Theories
Based on contemporary Chaos and Complexity Theories, ImaginationTOOLSTM is an innovative Virtual Reality (VR) software architecture which, by means of an agent-based interface, end...
Francesca Bertacchini, Eleonora Bilotta, Pietro Pa...
77
Voted
CORR
2008
Springer
101views Education» more  CORR 2008»
14 years 9 months ago
Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound
We study the one-way number-on-the-forehead (NOF) communication complexity of the k-layer pointer jumping problem with n vertices per layer. This classic problem, which has connec...
Joshua Brody, Amit Chakrabarti
EMSOFT
2004
Springer
15 years 3 months ago
Heterogeneous reactive systems modeling: capturing causality and the correctness of loosely time-triggered architectures (LTTA)
We present an extension of a mathematical framework proposed by the authors to deal with the composition of heterogeneous reactive systems. Our extended framework encompasses dive...
Albert Benveniste, Benoît Caillaud, Luca P. ...