Sciweavers

632 search results - page 96 / 127
» Proving Invariants of Functional Programs
Sort
View
131
Voted
MCMASTER
1993
15 years 4 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
78
Voted
SMC
2007
IEEE
146views Control Systems» more  SMC 2007»
15 years 6 months ago
Blender plugin implementations for 3D collaborative work
— The development of networking and client/server systems over the Internet had led to many collaborative work software applications. To extend the graphic design collaborative p...
Martin Lesage, Omar Cherkaoui, Faysal Abouzaid, Ma...
ICML
1996
IEEE
15 years 4 months ago
A Convergent Reinforcement Learning Algorithm in the Continuous Case: The Finite-Element Reinforcement Learning
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
Rémi Munos
107
Voted
EUROCOLT
1995
Springer
15 years 4 months ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
215
Voted
POPL
2009
ACM
16 years 1 months ago
Verifying distributed systems: the operational approach
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
Tom Ridge