1284 search results - page 143 / 257 » Abstract Processes in Orchestration Languages |
153
click to vote
ATAL
1995
Springer
15 years 8 months ago
1995
Springer
The agent view provides maybe the right level of abstraction for dealing with complex, distribblem-solving systems. It abstracts from aspects like the hardware or software platfor...
141
click to vote
CIE
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
161
click to vote
DASFAA
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
140
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
168
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Abstract. In this paper we describe how the language of Communicating Sequential Processes CSP has been applied to the analysis of a transport layer protocol used in the implementa...