186 search results - page 15 / 38 » Analyzing Loop Paths for Execution Time Estimation |
LCTRTS
2007
Springer
14 years 1 months ago
2007
Springer
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
SIAMJO
2010
13 years 2 months ago
2010
When liquidating a portfolio of large blocks of risky assets, an institutional investor wants to minimize the cost as well as the risk of execution. An optimal execution strategy ...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Hidden Markov Models (HMMs) model sequential data in many fields such as text/speech processing and biosignal analysis. Active learning algorithms learn faster and/or better by cl...
JTRES
2010
ACM
13 years 7 months ago
2010
ACM
With traditional testing, the test case has no control over non-deterministic scheduling decisions, and thus errors dependent on scheduling are only found by pure chance. Java Pat...