The general problem of classroom scheduling is well known to be NP-complete. A typical classroom scheduling problem is that of assigning students to a limited number of pieces of laboratory equipment. Frequently several identical pieces of equipment are available only at fixed hours and have limited access due to physical...
This paper describes an investigation of a matrix algebraic method to determine isomorphism in pairs of undirected graphs. The method is described in some detail. The theoretical as well as the practical difficulties are given. It is shown that the method works for some cases. When the adjacency matrix of...
Alignment of genomic sequences from different species is becoming an increasingly powerful method in biology, and is being used for many purposes. The result of sequence alignments is a list of pairs of matched locations between the pattern string and the text string. However, without any proper visualization tools to...
The FLEX/REFLEX paradigm is applied to the description of a computer program system. The paradigm is shown to be relevant and appropriate to computer program systems and to advantageously display and structure the general hierarchical characteristics of computer program systems. Program systems characterized in the paradigm are described both holistically...
Most measures of program complexity gauge either textual or
control flow attributes of a program. A recent addition to the field
of complexity measures, the knot metric, is a function of both these
attributes. A knot measurement reflects the degree of control-flow
tangle in a program's listing. This thesis discusses...
In this work we propose a computer based approach by means of
which the decision maker in Bendel State, Nigeria, can best be assisted
in the formulation of policies related to land use.
In Chapter I we briefly discuss the role of the computer in
planning and state the problem....
This paper demonstrates the effectiveness of a heuristic for
the Traveling Salesman Problem based purely on the efficient
storage of multiple partial sub-tours. The heuristic is among the
best available for the solution of large scale geometric Traveling
Salesman Problems. Additionally, a version of the heuristic can be
used to...
Sequential machines uniquely determine directed graphs. A path in a sequential machine may be specified by a starting state and an input sequence. A uniform Hamiltonian touring sequence (UHTS) is an input sequence that specifies a Hamiltonian path regardless of the starting state. We present a polynomial time algorithm that...
Why are the fast Fourier transform and the fast
Hadamard transform fast? A transform can be computed by
multiplying a matrix times a vector, which normally requires 0(n²) operations. The matrices corresponding to
these transforms can be rearranged to eliminate redundant
computations resulting in O(nlogn) operations.
We investigate algebraic reasons...
A study of the running time of several known algorithms and several new algorithms to compute the n[superscript th] element of the Fibonacci sequence is presented. Since the size of the n[superscript th] Fibonacci number grows exponentially with n, the number of bit operations, instead of the number of integer...