This item is only available for download by members of the University of Illinois community. Students, faculty, and staff at the U of I may log in with your NetID and password to view the item. If you are trying to access an Illinois-restricted dissertation or thesis, you can request a copy through your library's Inter-Library Loan office or purchase a copy directly from ProQuest.
Permalink
https://hdl.handle.net/2142/20644
Description
Title
Unbounded unimodal search and pursuit problems
Author(s)
Goldstein, Arthur Sander
Issue Date
1992
Doctoral Committee Chair(s)
Reingold, E.M.
Department of Study
Computer Science
Discipline
Computer Science
Degree Granting Institution
University of Illinois at Urbana-Champaign
Degree Name
Ph.D.
Degree Level
Dissertation
Keyword(s)
Computer Science
Language
eng
Abstract
A variation of Kraft's inequality is proven for a unimodal search tree. The inequality is used to prove the near optimality of an algorithm for solving the unbounded discrete unimodal search problem. New results on the computational complexity of determining if capture is possible is obtained for discrete pursuit problems. Similar techniques lead to new complexity results on some combinatorial games. Upper and lower bounds on the time for capture are developed for the continuous Lion-Man problem.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
