4565 search results - page 115 / 913 » Time Optimal Self-Stabilizing Algorithms |
115
Voted
EMSOFT
2010
Springer
14 years 10 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
115
Voted
ECRTS
2004
IEEE
15 years 4 months ago
2004
IEEE
This paper presents a new approach to understand the event stream model. Additionally a new approximation algorithm for the feasibility test of the sporadic and the generalized mu...
127
click to vote
SODA
2012
ACM
13 years 3 months ago
2012
ACM
In the Stochastic Orienteering problem, we are given a metric, where each node also has a job located there with some deterministic reward and a random size. (Think of the jobs as...
133
click to vote
WADS
2007
Springer
15 years 6 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
89
Voted
IPL
2008
15 years 21 days ago
2008
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...