Sciweavers

2796 search results - page 85 / 560
» The coolest path problem
Sort
View
IPPS
2007
IEEE
15 years 11 months ago
Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
Joseph R. Crobak, Jonathan W. Berry, Kamesh Maddur...
TCAD
1998
119views more  TCAD 1998»
15 years 4 months ago
A controller redesign technique to enhance testability of controller-data path circuits
—We study the effect of the controller on the testability of sequential circuits composed of controllers and data paths. We show that even when all the loops of the circuit have ...
Sujit Dey, Vijay Gangaram, Miodrag Potkonjak
TON
2010
158views more  TON 2010»
15 years 3 months ago
Always acyclic distributed path computation
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
Saikat Ray, Roch Guérin, Kin Wah Kwong, Rut...
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
15 years 2 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
ESA
2007
Springer
97views Algorithms» more  ESA 2007»
15 years 11 months ago
To Fill or Not to Fill: The Gas Station Problem
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
Samir Khuller, Azarakhsh Malekian, Julián M...