7150 search results - page 356 / 1430 » An Approximation Algorithm for Approximation Rank |
197
click to vote
EMSOFT
2004
Springer
16 years 4 days ago
2004
Springer
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
174
click to vote
SIGCOMM
1999
ACM
15 years 11 months ago
1999
ACM
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
196
click to vote
DAC
2010
ACM
15 years 10 months ago
2010
ACM
System optimization techniques based on dynamic voltage scaling (DVS) are widely used with the aim of reducing processor energy consumption. Inter-task DVS assigns the same voltag...
170
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
187
click to vote
FOIKS
2008
Springer
15 years 8 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...