Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
120
click to vote
DAGSTUHL
2000
120
views
Software Engineering
»
more
DAGSTUHL 2000
»
On the Competitive Complexity of Navigation Tasks
15 years 4 months ago
Download
www.pi6.fernuni-hagen.de
A strategy S solving a navigation task T is called competitive with ratio r if the cost of solving any instance t of T does not exceed r times the cost of solving t optimally. The ...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...
claim paper
Read More »