Sciweavers

1015 search results - page 80 / 203
» An efficient algorithm for AS path inferring
Sort
View
ICCAD
1999
IEEE
153views Hardware» more  ICCAD 1999»
14 years 14 days ago
Cycle time and slack optimization for VLSI-chips
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
Christoph Albrecht, Bernhard Korte, Jürgen Sc...
SIAMCOMP
2000
125views more  SIAMCOMP 2000»
13 years 8 months ago
Approximating the Stretch Factor of Euclidean Graphs
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
Giri Narasimhan, Michiel H. M. Smid
CCGRID
2009
IEEE
14 years 5 days ago
Energy-Efficient Cluster Computing via Accurate Workload Characterization
This paper presents an eco-friendly daemon that reduces power and energy consumption while better maintaining high performance via an accurate workload characterization that infer...
S. Huang, W. Feng
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 months ago
Shortest path problem in rectangular complexes of global nonpositive curvature
Abstract. CAT(0) metric spaces constitute a far-reaching common generalization of Euclidean and hyperbolic spaces and simple polygons: any two points x and y of a CAT(0) metric spa...
Victor Chepoi, Daniela Maftuleac
TMC
2011
158views more  TMC 2011»
13 years 3 months ago
Explicit Congestion Control Algorithms for Time Varying Capacity Media
—Explicit congestion control (XCC) is emerging as one potential solution for overcoming limitations inherent to the current TCP algorithm, characterized by unstable throughput, h...
Filipe Abrantes, João Taveira Araujo, Manue...