Sciweavers

1534 search results - page 8 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
WCET
2008
15 years 7 months ago
TuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis
TUBOUND is a conceptually new tool for the worst-case execution time (WCET) analysis of programs. A distinctive feature of TUBOUND is the seamless integration of a WCET analysis c...
Adrian Prantl, Markus Schordan, Jens Knoop
PODC
1994
ACM
15 years 10 months ago
Proving Time Bounds for Randomized Distributed Algorithms
Nancy A. Lynch, Isaac Saias, Roberto Segala
LION
2009
Springer
210views Optimization» more  LION 2009»
16 years 15 days ago
Beam-ACO Based on Stochastic Sampling: A Case Study on the TSP with Time Windows
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
Manuel López-Ibáñez, Christia...
HPDC
2007
IEEE
16 years 8 days ago
A statistical approach to risk mitigation in computational markets
We study stochastic models to mitigate the risk of poor Quality-of-Service (QoS) in computational markets. Consumers who purchase services expect both price and performance guaran...
Thomas Sandholm, Kevin Lai