523 search results - page 18 / 105 » On the Signal Bounding Problem in Timing Analysis |
IPL
2008
14 years 11 months ago
2008
In this paper, we prove polynomial running time bounds for an Ant Colony Optimization (ACO) algorithm for the single-destination shortest path problem on directed acyclic graphs. ...
AAAI
1993
15 years 1 months ago
1993
This paper analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous realtime versions of Q-learning and value-iteration, applied to the problem of...
TSP
2008
14 years 11 months ago
2008
Abstract--Digital processing techniques are based on representing a continuous-time signal by a discrete set of samples. This paper treats the problem of reconstructing a periodic ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
The behavior of some stochastic chemical reaction networks is largely unaffected by slight inaccuracies in reaction rates. We formalize the robustness of state probabilities to re...
104
click to vote
FSTTCS
1995
Springer
15 years 3 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...