Searching for a Global Search Algorithm

  • Authors:
  • Sabine Dick;Thomas Santen

  • Affiliations:
  • Universitä/t Bremen, FB3, Informatik, Bibliothekstraß/ et, D-28359 Bremen, Germany/ E-mail: sab&commat/informatik.uni-bremen.de;German National Research Center for Information Technology (GMD FIRST), Rudower Chaussee 5, D-12489 Berlin, Germany/ E-mail: santen&commat/first.gmd.de

  • Venue:
  • Automated Software Engineering
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We report on a case study to assess the use of an advancedknowledge-based software design technique with programmers who have notparticipated in the technique‘s development. We use the KIDS approachto algorithm design to construct two global search algorithms thatroute baggage through a transportation net. Construction of the secondalgorithm involves extending the KIDS knowledge base. Experience withthe case study leads us to integrate the approach with the spiral andprototyping models of software engineering, and to discuss ways to dealwith incomplete design knowledge.