Sciweavers

3061 search results - page 349 / 613
» interactions 2010
Sort
View
TACAS
2010
Springer
225views Algorithms» more  TACAS 2010»
16 years 1 months ago
Automated Termination Analysis for Programs with Second-Order Recursion
Many algorithms on data structures such as terms (finitely branching trees) are naturally implemented by second-order recursion: A first-order procedure f passes itself as an arg...
Markus Aderhold
ECSA
2010
Springer
15 years 5 months ago
Mediating Connector Patterns for Components Interoperability
A key objective for ubiquitous environments is to enable system interoperability between system’s components that are highly heterogeneous. In particular, the challenge is to emb...
Romina Spalazzese, Paola Inverardi
TPLP
2010
135views more  TPLP 2010»
15 years 5 months ago
Formalization of psychological knowledge in answer set programming and its application
In this paper we explore the use of Answer Set Programming (ASP) to formalize, and reason about, psychological knowledge. In the field of psychology, a considerable amount of kno...
Marcello Balduccini, Sara Girotto
QEST
2010
IEEE
15 years 4 months ago
DTMC Model Checking by SCC Reduction
Discrete-Time Markov Chains (DTMCs) are a widely-used formalism to model probabilistic systems. On the one hand, available tools like PRISM or MRMC offer efficient model checking a...
Erika Ábrahám, Nils Jansen, Ralf Wim...
PR
2011
15 years 1 months ago
A variational Bayesian methodology for hidden Markov models utilizing Student's-t mixtures
The Student’s-t hidden Markov model (SHMM) has been recently proposed as a robust to outliers form of conventional continuous density hidden Markov models, trained by means of t...
Sotirios Chatzis, Dimitrios I. Kosmopoulos