3 search results - page 1 / 1 » On Finite Alphabets and Infinite Bases: From Ready Pairs to ... |
FOSSACS
2004
Springer
13 years 8 months ago
2004
Springer
We prove that if a finite alphabet of actions contains at least two elements, then the equational theory for the process algebra BCCSP modulo any semantics no coarser than readines...
ICPR
2000
IEEE
14 years 5 months ago
2000
IEEE
An important theoretical tool in machine learning is the bias/variance decomposition of the generalization error. It was introduced for the mean square error in [3]. The bias/vari...
ESCIENCE
2006
IEEE
13 years 8 months ago
2006
IEEE
In this paper we present a general domain for the analysis of workflows and workflow components based on the notion of a collection of Turing machines sharing a set of tapes. We s...