707 search results - page 26 / 142 » Solving path problems on the GPU |
107
click to vote
JALC
2002
14 years 11 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
123
click to vote
NIPS
2004
15 years 1 months ago
2004
The problem of learning a sparse conic combination of kernel functions or kernel matrices for classification or regression can be achieved via the regularization by a block 1-norm...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
Abstract— In communication networks, multiple communication paths sharing minimum number of links or/and nodes may be desirable for improved performance, resource utilization and...
DATE
2002
IEEE
15 years 4 months ago
2002
IEEE
The problem of fault grading for multiple path delay faults is studied and a method of obtaining the exact coverage is presented. The faults covered are represented and manipulate...