Sciweavers

1092 search results - page 184 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
109
Voted
KRMED
2008
15 years 3 months ago
Exploiting Fast Classification of SNOMED CT for Query and Integration of Health Data
By constructing local extensions to SNOMED we aim to enrich existing medical and related data stores, simplify the expression of complex queries, and establish a foundation for se...
Michael Lawley
ATAL
2010
Springer
15 years 3 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
CLEF
2009
Springer
15 years 3 months ago
Morphological Analysis by Multiple Sequence Alignment
In biological sequence processing, Multiple Sequence Alignment (MSA) techniques capture information about long-distance dependencies and the three-dimensional structure of protein ...
Tzvetan Tchoukalov, Christian Monson, Brian Roark
FSTTCS
2008
Springer
15 years 2 months ago
Runtime Monitoring of Metric First-order Temporal Properties
ABSTRACT. We introduce a novel approach to the runtime monitoring of complex system properties. In particular, we present an online algorithm for a safety fragment of metric first...
David A. Basin, Felix Klaedtke, Samuel Müller...
EOR
2007
102views more  EOR 2007»
15 years 1 months ago
Sub-stochastic matrix analysis for bounds computation - Theoretical results
Performance evaluation of complex systems is a critical issue and bounds computation provides confidence about service quality, reliability, etc. of such systems. The stochastic ...
Serge Haddad, Patrice Moreaux