## Search

Now showing items 1-10 of 122

#### A supertree method for rooted trees

(University of Canterbury. Dept. of Mathematics, 1999)

The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of
classification, particularly evolutionary biology. In this paper, we describe ...

#### Group divisible designs with two associate classes

(University of Canterbury. Dept. of Mathematics, 1995)

The work in this research report was done while visiting The University of Canterbury, and was completed jointly in cooperation with H.L. Fu and D. Sarvate. These results
follow upon previous efforts where we were ...

#### Optimising hashing functions with genetic algorithms

(University of Canterbury, 1991)

Genetic algorithms (aka GA's) are a robust global search strategy that ignore local minima and irrelevant parameters, suitable for large search spaces. It is based on an analogy with natural evolution and survival of the ...

#### Queueing Models With Finite and Infinite Buffering Capacity : A Comparative Study

(University of Canterbury, 1991)

Queueing theory offers a large variety of techniques that can be used in performance modelling of computer systems and data communication networks. The diversity of assumptions causes that the numerical results, obtained ...

#### Reconstructing minimal rooted trees

(University of Canterbury, 1999)

For a set T of rooted binary leaf-labelled trees, we present an
algorithm that finds all of the minor-minimal trees that are compatible with
T. The running time of this algorithm is polynomial up to the number of trees
with ...

#### Hybrid Chebyshev collocation-series methods for elliptic problems

(University of Canterbury. Dept. of Mathematics, 1990)

#### Infinite antichains of matroids with characteristic set {p}

(University of Canterbury, 1999)

For each prime p, we construct an infinite antichain of matroids in
which each matroid has characteristic set {p}. For p=2, each of the matroids
in our antichain is an excluded minor for the class of matroids representable ...

#### Two applications of the divide & conquer principle in the molecular sciences

(University of Canterbury. Dept. of Mathematics, 1997)

One of the most powerful principles for solving complex tasks algorithmically is the so-called Divide& Conquer Principle. It has been applied successfully for an amazingly
wide range of problems, from combinatorial ...

#### Existence and uniqueness of collocating algebraic function approximations

(University of Canterbury. Dept. of Mathematics, 1990)

The problem of approximating a real-valued function by an algebraic function, where the approximation is determined by collocation at a sufficient number of distinct nodes, is
considered. Results are obtained for the ...

#### Towards pure adaptive search

(University of Canterbury. Dept. of Mathematics, 1993)

The algorithm known as Pure Adaptive Search is a global optimisation ideal with desirable complexity. In this paper we temper it to a framework we term
Somewhat Adaptive Search. This retains the desirable complexity, but ...