738 search results - page 59 / 148 » Cache modeling in probabilistic execution time analysis |
114
Voted
QEST
2006
IEEE
15 years 9 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
126
click to vote
GRID
2006
Springer
15 years 3 months ago
2006
Springer
In this paper we propose a systematic approach to performance analysis of workflow applications on the Grid. We introduce an ideal model for the workflow execution time and explain...
161
click to vote
TNN
2010
14 years 10 months ago
2010
Soft computing (SC) emerged as an integrating framework for a number of techniques that could complement one another quite well (artificial neural networks, fuzzy systems, evolutio...
142
Voted
WCET
2008
15 years 4 months ago
2008
Real-Time embedded systems must enforce strict timing constraints. In this context, achieving precise Worst Case Execution Time is a prerequisite to apply scheduling analysis and ...
149
Voted
APIN
2008
15 years 3 months ago
2008
Abstract Traditional financial analysis systems utilize lowlevel price data as their analytical basis. For example, a decision-making system for stock predictions regards raw price...