707 search results - page 2 / 142 » Solving path problems on the GPU |
SC
2009
ACM
13 years 9 months ago
2009
ACM
It has been shown that the sparse grid combination technique can be a practical tool to solve high dimensional PDEs arising in multidimensional option pricing problems in finance...
GECCO
2010
Springer
13 years 9 months ago
2010
Springer
The island model for evolutionary algorithms allows to delay the global convergence of the evolution process and encourage diversity. However, solving large size and time-intensiv...
ASIAMS
2007
IEEE
13 years 11 months ago
2007
IEEE
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
QSHINE
2005
IEEE
13 years 10 months ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...