1548 search results - page 127 / 310 » Computational Approaches to Sentence Completion |
SAC
2009
ACM
14 years 5 months ago
2009
ACM
Ensuring transactional behavior of business processes and web service compositions is an essential issue in the area of serviceoriented computing. Transactions in this context may ...
DSN
2005
IEEE
14 years 3 months ago
2005
IEEE
Supercomputing systems must be able to reliably and efficiently complete their assigned workloads, even in the presence of failures. This paper proposes a system that allows the ...
CHARME
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We propose a new saturation-based symbolic state-space generation algorithm for finite discrete-state systems. Based on the structure of the high-level model specificat...
KDD
1999
ACM
14 years 2 months ago
1999
ACM
We propose to use AdaBoost to efficiently learn classifiers over very large and possibly distributed data sets that cannot fit into main memory, as well as on-line learning wher...
MCU
2004
13 years 11 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...