Sciweavers

245 search results - page 39 / 49
» Using Finite State Automata for Sequence Mining
Sort
View
JCST
2008
114views more  JCST 2008»
13 years 7 months ago
Synthesizing Service Composition Models on the Basis of Temporal Business Rules
Transformational approaches to generating design and implementation models from requirements can bring effectiveness and quality to software development. In this paper we present a...
Jian Yu, Yanbo Han, Jun Han, Yan Jin, Paolo Falcar...
FORMATS
2010
Springer
13 years 5 months ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
HASE
2008
IEEE
14 years 2 months ago
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination
For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the c...
Debmalya Biswas, Thomas Gazagnaire, Blaise Genest
FORTE
1994
13 years 9 months ago
An improvement in formal verification
Critical safety and liveness properties of a concurrent system can often be proven with the help of a reachability analysis of a finite state model. This type of analysis is usual...
Gerard J. Holzmann, Doron Peled
EMNLP
2008
13 years 9 months ago
Lattice Minimum Bayes-Risk Decoding for Statistical Machine Translation
We present Minimum Bayes-Risk (MBR) decoding over translation lattices that compactly encode a huge number of translation hypotheses. We describe conditions on the loss function t...
Roy Tromble, Shankar Kumar, Franz Josef Och, Wolfg...