707 search results - page 96 / 142 » Solving path problems on the GPU |
101
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
121
click to vote
SYNASC
2006
IEEE
15 years 9 months ago
2006
IEEE
We present a new planning algorithm that formulates the planning problem as a counting satisfiability problem in which the number of available solutions guides the planner determ...
113
click to vote
ICCAD
2005
IEEE
16 years 3 days ago
2005
IEEE
— The flip-chip package gives the highest chip density of any packaging method to support the pad-limited Application-Specific Integrated Circuit (ASIC) designs. In this paper,...
123
Voted
ENTER
2009
Springer
15 years 10 months ago
2009
Springer
Mobile devices are becoming an inseparable part of our lives and personalized location-based mobile services are gaining more and more popularity. The scope of this paper is to il...
119
Voted
ACSAC
2002
IEEE
15 years 8 months ago
2002
IEEE
Abstract—To identify sources of distributed denial-of-service attacks, path traceback mechanisms have been proposed. Traceback mechanisms relying on probabilistic packet marking ...