28 search results - page 5 / 6 » Improved Shortest Path Algorithms For Nearly Acyclic Directe... |
PC
2010
13 years 7 months ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
AIPS
2010
13 years 11 months ago
2010
Compared to optimal planners, satisficing planners can solve much harder problems but may produce overly costly and long plans. Plan quality for satisficing planners has become in...
WSDM
2009
ACM
14 years 3 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
SIGMETRICS
2011
ACM
12 years 12 months ago
2011
ACM
Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifie...
ICMCS
2005
IEEE
14 years 2 months ago
2005
IEEE
We consider the problem of packetizing a variable length coded Markov sequence into fixed length packets, while being protected by variable rate channel code. Given the total tra...