3770 search results - page 187 / 754 » Building a Stochastic Dynamic Model of Application Use |
176
click to vote
CCGRID
2008
IEEE
15 years 7 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
155
click to vote
ICN
2007
Springer
15 years 11 months ago
2007
Springer
— In this paper, we use the Markov Decision Process (MDP) technique to find the optimal code allocation policy in High-Speed Downlink Packet Access (HSDPA) networks. A discrete ...
163
click to vote
BMCBI
2004
15 years 4 months ago
2004
Background: Hidden Markov Models (HMMs) have proven very useful in computational biology for such applications as sequence pattern matching, gene-finding, and structure prediction...
119
Voted
GD
2005
Springer
15 years 10 months ago
2005
Springer
Dynamic processes frequently occur in many applications. Visualizations of dynamically evolving data, for example as part of the data analysis, are typically restricted to a cumula...
151
Voted
TMI
2008
15 years 4 months ago
2008
A method is presented for the analysis of dynamic positron emission tomography (PET) data using sparse Bayesian learning. Parameters are estimated in a compartmental framework usin...