Search Constraints

Start Over
Filtering by: Creator Blakemore, Paul R. Remove constraint Creator: Blakemore, Paul R. Degree Field Computer Science Remove constraint Degree Field: Computer Science Subject Algorithms Remove constraint Subject: Algorithms

Search Results

  • Algorithms for computing Fibonacci numbers quickly

    Creator:
    Holloway, J. L.
    Abstract:
    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...
    Resource Type:
    Masters Thesis
    Full Text:
    Abstract approved:_ Paul Cull. A study of the running time of several known algorithms and several new

  • A fast algorithm for determining the primitivity of an n x n nonnegative matrix

    Creator:
    Leegard, Amanda D.
    Abstract:
    Nonnegative matrices have a myriad of applications in the biological, social, and physical genres. Of particular importance are the primitive matrices. A nonnegative matrix, M, is primitive exactly when there is a positive integer, k, such that M[superscript k] has only positive entries; that is, all the entries in M[superscript...
    Resource Type:
    Masters Thesis
    Full Text:
    Determining the Primitivity of an n x n Nonnegative Matrix Abstract approved Paul Cull Nonnegative matrices

  • Ensemble Monte-Carlo planning : an empirical study

    Creator:
    Lewis, Paul
    Abstract:
    Monte-Carlo planning algorithms such as UCT make decisions at each step by intelligently expanding a single search tree given the available time and then selecting the best root action. Recent work has provided evidence that it can be advantageous to instead construct an ensemble of search trees and make a...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF Paul Lewis for the degree

  • A Structural Theorem For Shortest Vertex-Disjoint Paths Computation in Planar Graphs

    Creator:
    Zafarani, Farzad
    Abstract:
    Given k terminal pairs (s₁,t₁),(s₂,t₂),..., (s[subscript k],t[subscript k]) in an edge-weighted graph G, the k Shortest Vertex-Disjoint Paths problem is to find a collection P₁, P₂,..., P[subscript k] of vertex-disjoint paths with minimum total length, where P[subscript i] is an s[subscript i]-to-t[subscript i] path. As a special case of the...
    Resource Type:
    Masters Thesis
    Full Text:
    tree of H rooted at R. Fix the color of π′k to be blue. Let B be any internal bigon (of H), with

  • Analysis of Bayesian anytime inference algorithms

    Creator:
    Burgess, Scott Alan
    Abstract:
    This dissertation explores and analyzes the performance of several Bayesian anytime inference algorithms for dynamic influence diagrams. These algorithms are compared on the On-Line Maintenance Agent testbed, a software artifact permitting comparison of dynamic reasoning algorithms used by an agent on a variety of simulated maintenance and monitoring tasks. Analysis...
    Resource Type:
    Dissertation
    Full Text:
    ; Dr. Paul Cull for instruction that has extended far beyond the classroom; Drs. Michael Quinn and