Sciweavers

552 search results - page 25 / 111
» Constrained Shortest Path Computation
Sort
View
TACAS
2007
Springer
110views Algorithms» more  TACAS 2007»
14 years 3 months ago
Counterexamples in Probabilistic Model Checking
This paper considers algorithms and complexity results for the generation of counterexamples in model checking of probabilistic until-formulae in discrete-time Markov chains (DTMCs...
Tingting Han, Joost-Pieter Katoen
FCCM
2006
IEEE
107views VLSI» more  FCCM 2006»
14 years 3 months ago
Hardware/Software Integration for FPGA-based All-Pairs Shortest-Paths
Field-Programmable Gate Arrays (FPGAs) are being employed in high performance computing systems owing to their potential to accelerate a wide variety of long-running routines. Par...
Uday Bondhugula, Ananth Devulapalli, James Dinan, ...
FOCS
1991
IEEE
14 years 1 months ago
On the Exponent of the All Pairs Shortest Path Problem
The upper bound on the exponent, ω, of matrix multiplication over a ring that was three in 1968 has decreased several times and since 1986 it has been 2.376. On the other hand, t...
Noga Alon, Zvi Galil, Oded Margalit
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
14 years 1 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
CPC
2006
69views more  CPC 2006»
13 years 9 months ago
Size and Weight of Shortest Path Trees with Exponential Link Weights
We derive the distribution of the number of links and the average weight for the shortest path tree (SPT) rooted at an arbitrary node to m uniformly chosen nodes in the complete g...
Remco van der Hofstad, Gerard Hooghiemstra, Piet V...