By Topic

Using machine learning to synthesize search programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
S. Minton ; Recom Technol., NASA Ames Res. Center, Moffett Field, CA, USA ; S. R. Wolfe

This paper describes how machine learning techniques are used in the MULTI-TAC system to specialize generic algorithm schemas for particular problem classes. MULTI-TAC is a program synthesis system that generates Lisp code to solve combinatorial integer constraint satisfaction problems. The use of algorithm schemas enables machine learning techniques to be applied in a very focused manner. These learning techniques enable the system to be sensitive to the distribution of instances that the system is expected to encounter. We describe two applications of machine learning in MULTI-TAC. The system learns domain specific heuristics, and then learns the most effective combination of heuristics on the training instances. We also describe empirical results that reinforce the viability of our approach

Published in:

Knowledge-Based Software Engineering Conference, 1994. Proceedings., Ninth

Date of Conference:

20-23 Sep 1994