The general problem-solving algorithm and its implementation

V. J. Rayward-Smith; G. P. McKeown; F. W. Burton

doi:10.1007/BF03037504

The general problem-solving algorithm and its implementation

V. J. Rayward-Smith, G. P. McKeown, F. W. Burton

School of Computing Sciences

Research output: Contribution to journal › Article

5 Citations (Scopus)

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.

Original language	English
Pages (from-to)	41-66
Number of pages	26
Journal	New Generation Computing
Volume	6
Issue number	1
DOIs	https://doi.org/10.1007/BF03037504
Publication status	Published - Jun 1988

Access to Document

10.1007/BF03037504

Cite this

@article{bbcab0536c8f4948a0cdd5606dfef9fd,

title = "The general problem-solving algorithm and its implementation",

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.",

author = "Rayward-Smith, {V. J.} and McKeown, {G. P.} and Burton, {F. W.}",

year = "1988",

month = jun,

doi = "10.1007/BF03037504",

language = "English",

volume = "6",

pages = "41--66",

journal = "New Generation Computing",

number = "1",

}

TY - JOUR

T1 - The general problem-solving algorithm and its implementation

AU - Rayward-Smith, V. J.

AU - McKeown, G. P.

AU - Burton, F. W.

PY - 1988/6

Y1 - 1988/6

N2 - 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.

AB - 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.

U2 - 10.1007/BF03037504

DO - 10.1007/BF03037504

M3 - Article

VL - 6

SP - 41

EP - 66

JO - New Generation Computing

JF - New Generation Computing

IS - 1

ER -