A unified model of algorithm design.
Published: 2007
Language: eng
Number of pages: 110
ISBN-13: 9780494273005
Description: We present a general model that may be instantiated to yield algorithms of various sorts. A three-axis classification system is developed, which define various classes of instantiations of the model. Each such class represents a set of constraints defining a subspace of the space of all algorithms, which corresponds to a particular well-known algorithmic paradigm. We examine related formalizations of priority, backtracking, branch and bound, divide and conquer, and dynamic programming algorithms, and show how each may be implemented and classified in our unified framework.
Notes: Source: Masters Abstracts International, Volume: 45-06, page: 3194.

Thesis (M.Sc.)--University of Toronto, 2007.

Electronic version licensed for access by U. of T. users.

ROBARTS MICROTEXT copy on microfiche.