Sciweavers

1805 search results - page 59 / 361
» A Theory of Closure Operators
Sort
View
AAAI
2008
15 years 6 months ago
Argument Theory Change Applied to Defeasible Logic Programming
In this article we work on certain aspects of the belief change theory in order to make them suitable for argumentation systems. This approach is based on Defeasible Logic Program...
Martín O. Moguillansky, Nicolás D. R...
139
Voted
MEMOCODE
2006
IEEE
15 years 10 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
ARITH
1997
IEEE
15 years 8 months ago
Theory and applications for a double-base number system
In this paper we present a rigorous theoretical analysis of the main properties of a double base number system, using bases 2 and 3; in particular we emphasize the sparseness of t...
Vassil S. Dimitrov, Graham A. Jullien, William C. ...
CONCURRENCY
2007
158views more  CONCURRENCY 2007»
15 years 4 months ago
Collective communication: theory, practice, and experience
We discuss the design and high-performance implementation of collective communications operations on distributed-memory computer architectures. Using a combination of known techni...
Ernie Chan, Marcel Heimlich, Avi Purkayastha, Robe...
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
15 years 8 months ago
A computable type theory for control systems
— In this paper, we develop a theory of computable types suitable for the study of control systems. The theory uses type-two effectivity as the underlying computational model, bu...
Pieter Collins