738 search results - page 59 / 148 » Cache modeling in probabilistic execution time analysis |
QEST
2006
IEEE
14 years 1 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...
GRID
2006
Springer
13 years 7 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...
TNN
2010
13 years 2 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...
WCET
2008
13 years 9 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 ...
APIN
2008
13 years 7 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...