707 search results - page 7 / 142 » Solving path problems on the GPU |
131
click to vote
ARC
2012
Springer
13 years 5 months ago
2012
Springer
Iterative numerical algorithms with high memory bandwidth requirements but medium-size data sets (matrix size ∼ a few 100s) are highly appropriate for FPGA acceleration. This pap...
79
Voted
IJCAI
1989
14 years 10 months ago
1989
A planning problem is time-dependent, if the time spent planning affects the utility of the system's performance. In [Dean and Boddy, 1988], we define a framework for constru...
JAIR
2006
14 years 9 months ago
2006
Distributed Constraint Satisfaction (DCSP) has long been considered an important problem in multi-agent systems research. This is because many real-world problems can be represent...
HAIS
2009
Springer
15 years 2 months ago
2009
Springer
The main purpose of this study is to find out a good solution to the vehicle routing problem considering heterogeneous vehicles. This problem tries to solve the generation of paths...
178
Voted
Publication
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...