133 search results - page 6 / 27 » DIJKSTRA |
TON
2002
13 years 7 months ago
2002
Prompted by the advent of quality-of-service routing in the Internet, we investigate the properties that path weight functions must have so that hop-by-hop routing is possible and ...
TVCG
2010
13 years 6 months ago
2010
CORR
2004
Springer
13 years 7 months ago
2004
Springer
We propose use of QR decomposition with sort and Dijkstra's algorithm for decreasing the computational complexity of the sphere decoder that is used for ML detection of signa...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure ch...
DIAGRAMS
2006
Springer
13 years 11 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...