Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Synthesis of local search algorithms by algebraic means

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
$31 $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)
Graham, R.P., Jr. ; Air Force Inst. of Technol., Wright-Patterson AFB, OH, USA ; Bailor, P.D.

Algebraic techniques have been applied successfully to algorithm synthesis by the use of algorithm theories and design tactics, an approach pioneered in the KIDS system but described and implemented only partly in algebraic terms. Local search is an effective and popular algorithmic approach to solving optimization problems, so that a formal characterization of this family is desirable. This paper describes a more purely algebraic approach to algorithm design and its application to the synthesis of local search algorithms

Published in:

Knowledge-Based Software Engineering Conference, 1996., Proceedings of the 11th

Date of Conference:

25-28 Sep 1996