Sciweavers

163 search results - page 23 / 33
» Composition Theorems in Communication Complexity
Sort
View
KI
2010
Springer
14 years 4 months ago
Differential Dynamic Logics
Hybrid systems are models for complex physical systems and are defined as dynamical systems with interacting discrete transitions and continuous evolutions along differential equa...
André Platzer
INFOCOM
2002
IEEE
15 years 2 months ago
On the capacity of wireless networks: The relay case
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
Michael Gastpar, Martin Vetterli
DATE
2003
IEEE
93views Hardware» more  DATE 2003»
15 years 3 months ago
Trade Offs in the Design of a Router with Both Guaranteed and Best-Effort Services for Networks on Chip
Managing the complexity of designing chips containing billions of transistors requires decoupling computation from communication. For the communication, scalable and compositional...
Edwin Rijpkema, Kees G. W. Goossens, Andrei Radule...
TSE
2008
97views more  TSE 2008»
14 years 9 months ago
Timed Automata Patterns
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
79
Voted
ESCIENCE
2006
IEEE
15 years 1 months ago
Designing Workflow Components for e-Science
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...
Frank Terpstra, Pieter W. Adriaans