Sciweavers

2333 search results - page 297 / 467
» Recursive Computational Depth
Sort
View
LOGCOM
2010
96views more  LOGCOM 2010»
15 years 22 days ago
The Complexity of the Warranted Formula Problem in Propositional Argumentation
The notion of warrant or justification is one of the central concepts in formal models of argumentation. The dialectical definition of warrant is expressed in terms of recursive...
Robin Hirsch, Nikos Gorogiannis
129
Voted
FSTTCS
2010
Springer
15 years 9 days ago
Place-Boundedness for Vector Addition Systems with one zero-test
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
Rémi Bonnet, Alain Finkel, Jérô...
142
Voted
LICS
2010
IEEE
15 years 6 days ago
A Sound and Complete Calculus for Finite Stream Circuits
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
Stefan Milius
ICASSP
2009
IEEE
15 years 1 days ago
Adaptive predistortion of nonlinear Volterra systems using Spectral Magnitude Matching
Digital compensation of nonlinear systems is an important topic in many practical applications. This paper considers the problem of predistortion of nonlinear systems described us...
Emad Abd-Elrady, Li Gan, Gernot Kubin
129
Voted
DATE
2010
IEEE
139views Hardware» more  DATE 2010»
14 years 11 months ago
A general mathematical model of probabilistic ripple-carry adders
Probabilistic CMOS is considered a promising technology for future generations of computing devices. By embracing possibly incorrect calculations, the technology makes it possible ...
Mark S. K. Lau, Keck Voon Ling, Yun-Chung Chu, Aru...