707 search results - page 94 / 142 » Solving path problems on the GPU |
114
click to vote
ICN
2001
Springer
15 years 4 months ago
2001
Springer
In this paper, we consider the backbone network design problem with a full set of QoS requirements. Unlike previous researches, we consider both the transmission line cost and the ...
FPGA
2006
ACM
15 years 3 months ago
2006
ACM
While previous research has shown that FPGAs can efficiently implement many types of computations, their flexibility inherently limits their clock rate. Several research groups ha...
EOR
2007
14 years 11 months ago
2007
An instance of a p-median problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest s...
115
click to vote
DAM
1999
14 years 11 months ago
1999
Several graph problems (e.g., steiner tree, connected domination, hamiltonian path, and isomorphism problem), which can be solved in polynomial time for distance-hereditary graphs...
107
click to vote
CPAIOR
2010
Springer
14 years 10 months ago
2010
Springer
Many search problems contain large amounts of redundancy in the search. In this paper we examine how to automatically exploit remaining subproblem equivalence, which arises when tw...