Sciweavers

707 search results - page 96 / 142
» Solving path problems on the GPU
Sort
View
FOCS
2003
IEEE
15 years 5 months ago
Approximation Algorithms for Orienteering and Discounted-Reward TSP
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...
Avrim Blum, Shuchi Chawla, David R. Karger, Terran...
SYNASC
2006
IEEE
103views Algorithms» more  SYNASC 2006»
15 years 5 months ago
Incremental Deterministic Planning
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...
Stefan Andrei, Wei-Ngan Chin, Martin C. Rinard
ICCAD
2005
IEEE
108views Hardware» more  ICCAD 2005»
15 years 8 months ago
A routing algorithm for flip-chip design
— 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,...
Jia-Wei Fang, I-Jye Lin, Ping-Hung Yuh, Yao-Wen Ch...
ENTER
2009
Springer
15 years 6 months ago
Personalized Mobile City Transport Advisory System
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...
Gytis Tumas, Francesco Ricci
ACSAC
2002
IEEE
15 years 4 months ago
GOSSIB vs. IP Traceback Rumors
Abstract—To identify sources of distributed denial-of-service attacks, path traceback mechanisms have been proposed. Traceback mechanisms relying on probabilistic packet marking ...
Marcel Waldvogel