2026-09-22T07:39:02Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/20644 2023-07-10 col_2142_5131 col_2142_10761 com_2142_5130 com_2142_10755 com_2142_234

Reingold, E.M. Goldstein, Arthur Sander 2011-05-07T12:45:12Z 2011-05-07T12:45:12Z 10000-01-01 1992 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. Made available in DSpace on 2011-05-07T12:45:12Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9236469.pdf: 3179586 bytes, checksum: 058030260d58c80d61664ea3e15271a3 (MD5) Previous issue date: 1992 Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:45:17Z Item is restricted indefinitely. Restriction data tranferred 2014-07-01T11:20:02-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission ETDs are only available to UIUC Users without author permission U of I Only AAI9236469 (UMI)AAI9236469 http://hdl.handle.net/2142/20644 eng Copyright 1992 Goldstein, Arthur Sander Computer Science Unbounded unimodal search and pursuit problems text Computer Science Computer Science University of Illinois at Urbana-Champaign Dissertation Ph.D.