2926 search results - page 190 / 586 » Partially Optimal Routing |
144
click to vote
CC
2003
Springer
15 years 8 months ago
2003
Springer
This paper presents a semantics-based compilation model for an aspect-oriented programming language based on its operational semantics. Using partial evaluation, the model can expl...
105
Voted
DAC
1994
ACM
15 years 7 months ago
1994
ACM
This paper introduces hot potato high level synthesis transformation techniques. These techniques add deflection operations in a computation in such a way that a specific goal is ...
115
Voted
ICFEM
2009
Springer
15 years 1 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
148
Voted
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
128
Voted
BROADNETS
2007
IEEE
15 years 9 months ago
2007
IEEE
Fast convergence to topology changes is a key requirement in modern routing infrastructure while reducing the protocol CPU overhead continues to be as important as before. In this...