lansky@SRI-VENICE.ARPA (Amy Lansky) (01/16/87)
AN IMPLEMENTATION OF ADAPTIVE SEARCH
Takashi Sakuragawa (TAKASHI@IBM.COM)
IBM T. J. Watson Research Center and Kyoto University
3:00 PM, FRIDAY, January 16
SRI International, Building E, Room EK242
The Adaptive Optimizer is a program that optimizes Prolog programs by
reordering clauses. It is an implementation of Natarajan's adaptive
search algorithm that reorders the subproblems of a disjunctive
problem and minimizes the expected search effort. This talk will
describe implementation details as well as how the efficiency of an
example tree search program is improved. In this particular example,
the execution speed of the optimized program is more than 200 times
faster than the original one. The speed improvement observed is for
an artificial example and is not necessarily representative of what
might be obtained from real applications.