Files in this item



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


Title:Improvement of constrained searches
Author(s):Gooley, Markian Myron
Doctoral Committee Chair(s):Wah, Benjamin W.
Department / Program:Computer Science
Discipline:Computer Science
Degree Granting Institution:University of Illinois at Urbana-Champaign
Subject(s):Computer Science
Abstract:Search is ubiquitous in computer science, but most searches are performed under constraints: time, memory, dependences. We study several cases of constrained search and present methods for improving their performance. Execution of Prolog programs amounts to a search with several types of dependences. We present a method for static reordering of goals in Prolog clauses, characterizing the degrees of equivalence between the original and reordered code, characterizing restrictions on reordering, presenting a heuristic for choosing amongst permissible reorderings, and showing how to restore equivalence that might be lost in the reordering process. Heuristic search in restricted memory is another constrained search. We present a new method called speculative search which is competitive with other searches used when memory is limited.
Issue Date:1991
Rights Information:Copyright 1991 Gooley, Markian Myron
Date Available in IDEALS:2011-05-07
Identifier in Online Catalog:AAI9210817
OCLC Identifier:(UMI)AAI9210817

This item appears in the following Collection(s)

Item Statistics

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