The general problem solving algorithm and its implementation
VJ Rayward-Smith, GP McKeown, FW Burton - New generation computing, 1988 - Springer
VJ Rayward-Smith, GP McKeown, FW Burton
New generation computing, 1988•SpringerBy 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.
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.
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.
Springer
Showing the best result for this search. See all results