Sciweavers

2626 search results - page 111 / 526
» The complexity of stochastic sequences
Sort
View
160
Voted
BMCBI
2005
100views more  BMCBI 2005»
15 years 6 months ago
Evolutionary models for insertions and deletions in a probabilistic modeling framework
Background: Probabilistic models for sequence comparison (such as hidden Markov models and pair hidden Markov models for proteins and mRNAs, or their context-free grammar counterp...
Elena Rivas
SFM
2007
Springer
16 years 7 days ago
Tackling Large State Spaces in Performance Modelling
Stochastic performance models provide a powerful way of capturing and analysing the behaviour of complex concurrent systems. Traditionally, performance measures for these models ar...
William J. Knottenbelt, Jeremy T. Bradley
158
Voted
STACS
1999
Springer
15 years 10 months ago
A Complete and Tight Average-Case Analysis of Learning Monomials
Abstract. We advocate to analyze the average complexity of learning problems. An appropriate framework for this purpose is introduced. Based on it we consider the problem of learni...
Rüdiger Reischuk, Thomas Zeugmann
178
Voted
SIMVIS
2003
15 years 7 months ago
An Experimental Study of the Behaviour of the Proxel-Based Simulation Algorithm
The paradigm of the proxel ("probability element") was recently introduced in order to provide a new algorithmic approach to analysing discrete-state stochastic models s...
Sanja Lazarova-Molnar, Graham Horton
SCP
2000
119views more  SCP 2000»
15 years 5 months ago
Automated compositional Markov chain generation for a plain-old telephone system
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
Holger Hermanns, Joost-Pieter Katoen