Search Constraints

Start Over
Filtering by: Creator Huntsberger, John Paul Remove constraint Creator: Huntsberger, John Paul Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • A comparison of simulated annealing and genetic algorithms for the genome mapping problems

    Creator:
    Gunnels, John A.
    Abstract:
    The data used for the construction of genome maps is imperfect, therefore the mapping of a physically linear structure must take place in a very uneven feature space. As the number of genes to be ordered grows, it appears to be impractical to use exhaustive search techniques to find the...
    Resource Type:
    Masters Thesis
    Full Text:
    AN ABSTRACT OF THE THESIS OF John A. Gunnels for the degree

  • An alternative architecture for performing basic computer arithmetical operations

    Creator:
    Djang, Kevin
    Abstract:
    The arithmetic portions of almost all modern processor architectures are of very similar design. We use the term "traditional" to describe this design, the primary characteristics of which are native support for integer and floating-point number types and special disjoint instructions and hardware for each supported type. Decades of refinement...
    Resource Type:
    Masters Thesis
    Full Text:
    Computer Arithmetical Operations. Abstract approved: Paul Cull The arithmetic portions of almost all

  • Computers and planning : a study of the computer simulation methodology for land use planning in Bendel State, Nigeria

    Creator:
    Obi, Gabriel Michael
    Abstract:
    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....
    Resource Type:
    Masters Thesis
    Full Text:
    Abstract approved: Redacted for Privacy Paul Cull In this work we propose a computer based approach by

  • 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

  • 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 library for doing polyhedral operations

    Creator:
    Wilde, Doran K.
    Abstract:
    Polyhedra are geometric representations of linear systems of equations and inequalities. Since polyhedra are used to represent the iteration domains of nested loop programs, procedures for operating on polyhedra can be used for doing loop transformations and other program restructuring transformations which are needed in parallelizing compilers. Thus a need...
    Resource Type:
    Masters Thesis
    Full Text:
    December 6, 1993 Title: A Library for Doing Polyhedral Operations Abstract approved. Dr. Paul Cull

  • The FLEX/REFLEX paradigm and its application to computer program systems

    Creator:
    Colby, Jonathan Axford
    Abstract:
    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...
    Resource Type:
    Masters Thesis
    Full Text:
    and Its Application to Computer Program Systems Abstract approved: Redacted for Privacy Paul Cull

  • Probabilistic computation in stochastic pulse neuromime networks

    Creator:
    Hangartner, Ricky Dale
    Resource Type:
    Dissertation
    Full Text:
    Neuromime Networks Abstract approved- Paul Cull. Biological neural networks embody a unique combination

  • A linear equation model for a family of interconnection networks

    Creator:
    Larson, Shawn M.
    Abstract:
    The most important part of parallel computation is communication. Except in the most embarassingly parallel examples, processors cannot work cooperatively to solve a problem unless they can communicate. One way to solve the problem of communication is to use an interconnection network. Processors are located at nodes of the network,...
    Resource Type:
    Dissertation
    Full Text:
    Interconnection Networks Abstract approved. Dr. Paul Cull The most important part of parallel computation is

  • Machine learning in engineering : techniques to speed up numerical optimization

    Creator:
    Cerbone, G. (Giuseppe)
    Abstract:
    Many important application problems in engineering can be formalized as nonlinear optimization tasks. However, numerical methods for solving such problems are brittle and do not scale well. For example, these methods depend critically on choosing a good starting point from which to perform the optimization search. In high-dimensional spaces, numerical...
    Resource Type:
    Dissertation
    Full Text:
    Redacted for Privacy Paul Cull Abstract Many important application problems in engineering can be