Biblioteca Digital

20 resultados para Probabilistic Finite Automata

em Department of Computer Science E-Repository - King's College London, Strand, London

Distributed pattern matching using finite Automata

Relevância:

100.00% 100.00%

Publicador:

Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata

Relevância:

100.00% 100.00%

Publicador:

Finding Common Motifs with Gaps using Finite Automata

Relevância:

100.00% 100.00%

Publicador:

Minimizing incomplete automata

Relevância:

30.00% 30.00%

Publicador:

S5×S5×S5 lacks the finite model property

Relevância:

20.00% 20.00%

Publicador:

Products of `transitive' modal logics without the (abstract) finite model property

Relevância:

20.00% 20.00%

Publicador:

Verification and Prediction of Timed Probabilistic Properties over the Distributed Management Taskforce Common Information Model

Relevância:

20.00% 20.00%

Publicador:

Verification and Prediction of Timed Probabilistic Properties over the Distributed Management Taskforce Common Information Model

Relevância:

20.00% 20.00%

Publicador:

Predictable Component Architectures Using Dependent Finite State Machines

Relevância:

20.00% 20.00%

Publicador:

Runtime Verification of Timing and Probabilistic Properties using WMI and .NET.

Relevância:

20.00% 20.00%

Publicador:

Probabilistic Abductive Computation of Evidence Collection Strategies in Crime Investigation

Relevância:

20.00% 20.00%

Publicador:

Heuristics for fault diagnosing when testing from finite state machines

Relevância:

20.00% 20.00%

Publicador:

Input sequence generation for testing of communicating finite state machines (CFSMs)

Relevância:

20.00% 20.00%

Publicador:

Coping with Inaccurate Reputation Sources: Experimental Analysis of a Probabilistic Trust Model

Relevância:

20.00% 20.00%

Publicador:

Waiting time and complexity for matching patterns with automata

Relevância:

20.00% 20.00%

Publicador:

«
1
2
»