Files in this item



application/pdf9236469.pdf (3MB)Restricted to U of Illinois
(no description provided)PDF


Title:Unbounded unimodal search and pursuit problems
Author(s):Goldstein, Arthur Sander
Doctoral Committee Chair(s):Reingold, E. M.
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Computer Science
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.
Issue Date:1992
Rights Information:Copyright 1992 Goldstein, Arthur Sander
Date Available in IDEALS:2011-05-07
Identifier in Online Catalog:AAI9236469
OCLC Identifier:(UMI)AAI9236469

This item appears in the following Collection(s)

Item Statistics

  • Total Downloads: 1
  • Downloads this Month: 0
  • Downloads Today: 0