Sciweavers

29 search results - page 4 / 6
» A Theory for Abstract Reduction Systems in PVS
Sort
View
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 11 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
CDC
2008
IEEE
157views Control Systems» more  CDC 2008»
14 years 2 months ago
Balancing of partially-observed stochastic differential equations
Abstract— We study Balanced Truncation for stochastic differential equations. In doing so, we adopt ideas from large deviations theory and discuss notions of controllability and ...
Carsten Hartmann, Christof Schütte
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
Definitions by Rewriting in the Calculus of Constructions
Abstract : The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prov...
Frédéric Blanqui
IANDC
1998
70views more  IANDC 1998»
13 years 7 months ago
Diagram Techniques for Confluence
op diagram techniques for proving confluence in abstract reductions systems. The underlying theory gives a systematic and uniform framework in which a number of known results, wide...
Marc Bezem, Jan Willem Klop, Vincent van Oostrom
IJCNN
2007
IEEE
14 years 1 months ago
Computational Templates, Neural Network Dynamics, and Symbolic Logic
— The relationship between subsymbolic neural networks and symbolic logical systems is discussed from the point of view of the account of computational science by Paul Humphreys ...
Otto Lappi