Sciweavers

71 search results - page 2 / 15
» An Evolving Algebra Abstract Machine
Sort
View
FMCO
2003
Springer
123views Formal Methods» more  FMCO 2003»
13 years 11 months ago
Machine Function Based Control Code Algebras
Abstract. Machine functions have been introduced by Earley and Sturgis in [6] in order to provide a mathematical foundation of the use of the T-diagrams proposed by Bratman in [5]....
Jan A. Bergstra
TCS
2008
13 years 5 months ago
Using bisimulation proof techniques for the analysis of distributed abstract machines
Analysis of Distributed Abstract Machines Damien Pous ENS Lyon, France. We illustrate the use of recently developed proof techniques for weak bisimulation sing a generic framework...
Damien Pous
ICDT
2007
ACM
143views Database» more  ICDT 2007»
14 years 3 days ago
Database Query Processing Using Finite Cursor Machines
We introduce a new abstract model of database query processing, finite cursor machines, that incorporates certain data streaming aspects. The model describes quite faithfully what...
Martin Grohe, Yuri Gurevich, Dirk Leinders, Nicole...
JLP
2007
89views more  JLP 2007»
13 years 5 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
IJON
2006
161views more  IJON 2006»
13 years 6 months ago
Evolving hybrid ensembles of learning machines for better generalisation
Ensembles of learning machines have been formally and empirically shown to outperform (generalise better than) single predictors in many cases. Evidence suggests that ensembles ge...
Arjun Chandra, Xin Yao