The general problem-solving algorithm and its implementation

Rayward-Smith, V. J., McKeown, G. P. and Burton, F. W. (1988) The general problem-solving algorithm and its implementation. New Generation Computing, 6 (1). pp. 41-66.

Full text not available from this repository. (Request a copy)

Abstract

By generalising problem solving techniques such as divide-and-conquer, dynamic programming, tree and graph searching, integer programming and branch-and-bound, a general problem solving algorithm is deduced. Various examples of the use of this algorithm are given and its implementation on both sequential and parallel machines, such as the cosmic cube, is discussed.

Item Type:	Article
Faculty \ School:	Faculty of Science > School of Computing Sciences
Depositing User:	EPrints Services
Date Deposited:	01 Oct 2010 13:41
Last Modified:	28 Mar 2025 05:09
URI:	https://ueaeprints.uea.ac.uk/id/eprint/3141
DOI:	10.1007/BF03037504

Actions (login required)

View Item