Sciweavers

1817 search results - page 151 / 364
» Extensive Games as Process Models
Sort
View
CORR
2006
Springer
81views Education» more  CORR 2006»
15 years 3 months ago
Universal Filtering via Hidden Markov Modeling
The problem of discrete universal filtering, in which the components of a discrete signal emitted by an unknown source and corrupted by a known discrete memoryless channel (DMC) ar...
Taesup Moon, Tsachy Weissman
BMCBI
2005
87views more  BMCBI 2005»
15 years 3 months ago
Efficient decoding algorithms for generalized hidden Markov model gene finders
Background: The Generalized Hidden Markov Model (GHMM) has proven a useful framework for the task of computational gene prediction in eukaryotic genomes, due to its flexibility an...
William H. Majoros, Mihaela Pertea, Arthur L. Delc...
SIMUTOOLS
2008
15 years 4 months ago
Snoopy: a tool to design and animate/simulate graph-based formalisms
We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along wit...
Monika Heiner, Ronny Richter, Martin Schwarick
PPOPP
2010
ACM
16 years 17 days ago
Symbolic prefetching in transactional distributed shared memory
We present a static analysis for the automatic generation of symbolic prefetches in a transactional distributed shared memory. A symbolic prefetch specifies the first object to be...
Alokika Dash, Brian Demsky
114
Voted
SARA
2009
Springer
15 years 10 months ago
A Practical Use of Imperfect Recall
Perfect recall is the common and natural assumption that an agent never forgets. As a consequence, the agent can always condition its choice of action on any prior observations. I...
Kevin Waugh, Martin Zinkevich, Michael Johanson, M...