391 search results - page 65 / 79 » Compositionality for Probabilistic Automata |
SOFSEM
2007
Springer
14 years 1 months ago
2007
Springer
We investigate deterministically simulating (i.e., solving the membership problem for) nondeterministic finite automata (NFA), relying solely on the NFA’s resources (states and ...
CAV
2000
Springer
13 years 12 months ago
2000
Springer
Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. Pnueli Invited Address...
ESOP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
ICCV
2007
IEEE
14 years 9 months ago
2007
IEEE
We propose to use high-level visual information to improve illuminant estimation. Several illuminant estimation approaches are applied to compute a set of possible illuminants. Fo...
CEC
2009
IEEE
14 years 2 months ago
2009
IEEE
— The paper proposes a hypernetwork-based method for stock market prediction through a binary time series problem. Hypernetworks are a random hypergraph structure of higher-order...