Computer Science: Recent submissions
Now showing items 116-120 of 297
-
The combinatorics of abstract container data types
(University of St Andrews, 1997) - ThesisThe study of abstract machines such as Turing machines, push down automata and finite state machines has played an important role in the advancement of computer science. It has led to developments in the theory of general ... -
The imperative implementation of algebraic data types
(University of St Andrews, 1988) - ThesisThe synthesis of imperative programs for hierarchical, algebraically specified abstract data types is investigated. Two aspects of the synthesis are considered: the choice of data structures for efficient implementation, ... -
Robustness and generalisation : tangent hyperplanes and classification trees
(University of St Andrews, 1997) - ThesisThe issue of robust training is tackled for fixed multilayer feedforward architectures. Several researchers have proved the theoretical capabilities of Multilayer Feedforward networks but in practice the robust convergence ... -
Using constraints to improve generalisation and training of feedforward neural networks : constraint based decomposition and complex backpropagation
(University of St Andrews, 1996) - ThesisNeural networks can be analysed from two points of view: training and generalisation. The training is characterised by a trade-off between the 'goodness' of the training algorithm itself (speed, reliability, guaranteed ... -
Abstract machine design for increasingly more powerful ALGOL-languages
(University of St Andrews, 1985) - ThesisThis thesis presents the work and results of an investigation into language implementation. Some work on language design has also been undertaken. Three languages have been implemented which may be described as members of ...