Sciweavers

24421 search results - page 155 / 4885
» Communicating Complex Systems
Sort
View
DATE
2003
IEEE
140views Hardware» more  DATE 2003»
14 years 2 months ago
Qualifying Precision of Abstract SystemC Models Using the SystemC Verification Standard
ng precision of abstract SystemC models using the SystemC Verification Standard Franco Carbognani1 , Christopher K. Lennard2 , C. Norris Ip3 , Allan Cochrane2 , Paul Bates2 1 Caden...
Franco Carbognani, Christopher K. Lennard, C. Norr...
APPROX
2009
Springer
118views Algorithms» more  APPROX 2009»
14 years 3 months ago
Hellinger Strikes Back: A Note on the Multi-party Information Complexity of AND
The AND problem on t bits is a promise decision problem where either at most one bit of the input is set to 1 (NO instance) or all t bits are set to 1 (YES instance). In this note...
T. S. Jayram
CDES
2006
80views Hardware» more  CDES 2006»
13 years 10 months ago
Communicating Distributed H systems with Simple Splicing Rules
In this paper we define communicating distributed H systems with simple splicing rules of types (1,3), (1,4) and (2,3) and study the generative capacity. keyword: Splicing systems,...
Kamala Krithivasan, Prahladh Harsha, Muralidhar Ta...
ICC
2008
IEEE
121views Communications» more  ICC 2008»
14 years 3 months ago
Low-Complexity Pattern-Eliminating Codes for ISI-Limited Channels
— This paper introduces low-complexity block codes, termed pattern-eliminating codes (PEC), which achieve a potentially large performance improvement over channels with residual ...
Natasa Blitvic, Lizhong Zheng, Vladimir Stojanovic
TIME
2008
IEEE
14 years 3 months ago
Practical First-Order Temporal Reasoning
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variet...
Clare Dixon, Michael Fisher, Boris Konev, Alexei L...