5169 search results - page 535 / 1034 » Locality approximation using time |
194
Voted
TCAD
2002
15 years 7 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
219
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— We present a distributed scheduling algorithm for provisioning of guaranteed link bandwidths in ad hoc mesh networks. The guaranteed link bandwidths are necessary to provide de...
192
Voted
MFCS
2007
Springer
16 years 1 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
206
click to vote
RTCSA
2006
IEEE
16 years 1 months ago
2006
IEEE
The load parameter of a sporadic task system is defined to be the largest possible cumulative execution requirement that can be generated by jobs of the task system over any time...
206
click to vote
ICITA
2005
IEEE
16 years 1 months ago
2005
IEEE
Optimum theorems for combining QoS metrics to reduce computation time in nodes (routers) is proposed based on fundamental theorems on QoS metrics. The proposed theorems unify sele...