Sciweavers

707 search results - page 4 / 142
» Solving path problems on the GPU
Sort
View
NETWORKS
2008
13 years 9 months ago
Lagrangian relaxation and enumeration for solving constrained shortest-path problems
Recently published research indicates that a vertex-labeling algorithm based on dynamic-programming concepts is the most efficient procedure available for solving constrained shor...
W. Matthew Carlyle, Johannes O. Royset, R. Kevin W...
PC
2010
145views Management» more  PC 2010»
13 years 8 months ago
GPU computing with Kaczmarz's and other iterative algorithms for linear systems
The graphics processing unit (GPU) is used to solve large linear systems derived from partial differential equations. The differential equations studied are strongly convection-...
Joseph M. Elble, Nikolaos V. Sahinidis, Panagiotis...
DAM
2008
101views more  DAM 2008»
13 years 10 months ago
Three Hoppy path problems and ternary paths
In this paper we solve several recurrence relations with two (three) indices using combinatorial methods. Moreover, we present several recurrence relations with two (three) indice...
Eva Yu-Ping Deng, Toufik Mansour
IAT
2006
IEEE
14 years 3 months ago
Toward Inductive Logic Programming for Collaborative Problem Solving
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
Jian Huang, Adrian R. Pearce
DIAGRAMS
2006
Springer
14 years 1 months ago
Exploring the Effect of Animation and Progressive Revealing on Diagrammatic Problem Solving
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...
Daesub Yoon, N. Hari Narayanan, SooCheol Lee, Oh-C...