4798 search results - page 321 / 960 » A Time for Change |
175
click to vote
WEA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
159
click to vote
DATE
2008
IEEE
16 years 1 months ago
2008
IEEE
— Criticality and yield gradients are two crucial diagnostic metrics obtained from Statistical Static Timing Analysis (SSTA). They provide valuable information to guide timing op...
172
click to vote
ISPDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Self-stabilizing token circulation algorithms are not always adapted for dynamic networks. Random walks are well known to play a crucial role in the design of randomized algorithm...
218
click to vote
MSWIM
2006
ACM
16 years 19 days ago
2006
ACM
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
160
click to vote
SKG
2005
IEEE
16 years 8 days ago
2005
IEEE
Efficient task scheduling is critical to achieving high performance on grid computing environment. A heuristic task scheduling algorithm satisfied resources load balancing on grid ...