Sciweavers

2060 search results - page 166 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
IPPS
2005
IEEE
15 years 3 months ago
Automatic Support for Irregular Computations in a High-Level Language
The problem of writing high performance parallel applications becomes even more challenging when irregular, sparse or adaptive methods are employed. In this paper we introduce com...
Jimmy Su, Katherine A. Yelick
DAC
1997
ACM
15 years 2 months ago
Hardware/Software Co-Simulation in a VHDL-Based Test Bench Approach
Novel test bench techniques are required to cope with a functional test complexity which is predicted to grow much more strongly than design complexity. Our test bench approach at...
Matthias Bauer, Wolfgang Ecker
DSN
2007
IEEE
15 years 4 months ago
On the Cost of Modularity in Atomic Broadcast
Modularity is a desirable property of complex software systems, since it simplifies code reuse, verification, maintenance, etc. However, the use of loosely coupled modules intro...
Olivier Rütti, Sergio Mena, Richard Ekwall, A...
AAAI
2006
14 years 11 months ago
Forgetting and Conflict Resolving in Disjunctive Logic Programming
We establish a declarative theory of forgetting for disjunctive logic programs. The suitability of this theory is justified by a number of desirable properties. In particular, one...
Thomas Eiter, Kewen Wang
CORR
2008
Springer
157views Education» more  CORR 2008»
14 years 10 months ago
The Imaginary Sliding Window As a New Data Structure for Adaptive Algorithms
Abstract.1 The scheme of the sliding window is known in Information Theory, Computer Science, the problem of predicting and in stastistics. Let a source with unknown statistics gen...
Boris Ryabko