26 search results - page 2 / 6 » A Shortest Path Search Algorithm Using an Excitable Digital ... |
ISCA
2008
IEEE
13 years 6 months ago
2008
IEEE
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
HIPC
2007
Springer
13 years 10 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
SENSYS
2003
ACM
13 years 11 months ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
ICPP
2006
IEEE
14 years 13 days ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...