747 search results - page 76 / 150 » Theory and Construction of Molecular Computers |
WWW
2003
ACM
14 years 9 months ago
2003
ACM
The construction of composite Web Services from service fragments requires semantic descriptions of service offers and service requests. We propose the use of dependencies as a mo...
CALCO
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Coalgebra automata, introduced by the second author, generalize the well-known automata that operate on infinite words/streams, trees, graphs or transition systems. This...
COLT
2007
Springer
14 years 3 months ago
2007
Springer
When comparing discrete probability distributions, natural measures of similarity are not p distances but rather are informationdivergences such as Kullback-Leibler and Hellinger. ...
LPAR
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
ROOM
2000
13 years 10 months ago
2000
We describe a language which can be used to model business processes (both technical and nontechnical). It has a formal semantics, so as to enable formal analysis and prediction o...