Search Constraints

Start Over
Filtering by: DOI 10.5849/wjaf.11-027 Remove constraint DOI: 10.5849/wjaf.11-027 Degree Field Computer Science Remove constraint Degree Field: Computer Science Resource Type Masters Thesis Remove constraint Resource Type: Masters Thesis

Search Results

  • Computer techniques yielding automatic and rigorous solutions to linear and nonlinear integral equations

    Creator:
    Winter, Lynn Taylor
    Abstract:
    Interval arithmetic is applied to the problem of obtaining rigorous solutions to integral equations on a computer. The integral equations considered are the linear Fredholm equation of the second kind and the nonlinear Urysohn equation. Techniques are presented which enable the computer to find an approximate solution, prove the existence...
    Resource Type:
    Masters Thesis
    Full Text:
    applicable to linear Fredholm integral equations of the second kind. Yungen [11] applied this theory to

  • The "Mobius Cube" : an interconnection network for parallel computation

    Creator:
    Larson, Shawn M.
    Resource Type:
    Masters Thesis
    Full Text:
    . The algorithm for generating Hamiltonian circuits 36 Figure 11. A Hamiltonian circuit for M6bius 4

  • Prediction of gene transcription start sites and initiation patterns from DNA sequence content

    Creator:
    Morton, Taj H.
    Abstract:
    The computational identification of gene Transcription Start Sites (TSSs) can provide insights into the regulation and function of genes without performing expensive experiments, particularly in organisms with incomplete annotations. High-resolution general-purpose TSS prediction remains a challenging problem, with little recent progress on the identification and differentiation of TSSs which are...
    Resource Type:
    Masters Thesis
    Full Text:
    Figure 10: Example of TIPR gene scan output surrounding CAGE TSS .................... 42 Figure 11

  • Learning classification rules by randomized iterative local search

    Creator:
    Chisholm, Michael (Michael Andrew), 1974-
    Abstract:
    Learning easily understandable decision rules from examples is one of the classic problems in machine learning. Most learning algorithms for this problem employ some variation of a greedy separate-and-conquer algorithm. In this paper, we describe a system called LERILS that learns highly accurate and comprehensible rules from examples using a...
    Resource Type:
    Masters Thesis
    Full Text:
    , RIPPER, and CN2 on 11 data sets from the UCI machine learning repository. We show that LERILS can

  • Probability of deadlock in a system of processes and resources for shared and exclusive access

    Creator:
    Baghgandomi, Shahla Saidi
    Abstract:
    A process-resource graph is a directed graph with m resource nodes and n process nodes. A request edge is directed from a process to a resource. An assignment edge is directed from a resource to a process. A cycle in the process-resource graph is a necessary and sufficient condition for...
    Resource Type:
    Masters Thesis
    Full Text:
    degree of Master of Science in Computer Science presented on August 11, 1982 Title: PROBABILITY OF

  • A multi-tour heuristic for the traveling salesman problem

    Creator:
    Starr, Robert W.
    Abstract:
    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...
    Resource Type:
    Masters Thesis
    Full Text:
    Science presented on July 11, 1980 Title: A Multi-Tour Heuristic for the Traveling Salesman Problem

  • Complexity of probabilistic inference in belief nets--an experimental study

    Creator:
    Li, Zhaoyu
    Abstract:
    There are three families of exact methods used for probabilistic inference in belief nets. It is necessary to compare them and analyze the advantages and the disadvantages of each algorithm, and know the time cost of making inferences in a given belief network. This paper discusses the factors that influence...
    Resource Type:
    Masters Thesis
    Full Text:
    11. Comparison between the predicted time , In(estimate), and real computation time, In(time) for

  • Expert-gate algorithm

    Creator:
    Joshi, Varad Vidyadhar
    Abstract:
    The goal of Inductive Learning is to produce general rules from a set of seen examples, which can then be applied to other unseen examples. ID3 is an inductive learning algorithm that can be used for the classification task. The input to the algorithm is a set of tuples of...
    Resource Type:
    Masters Thesis
    Full Text:
    Algorithms 3 1.2.1 ID3 3 1.2.2 Fringe 6 1.3 Thesis Outline 8 2 The Expert-Gate Algorithm 11 2.1

  • A compiler-compiler for the CDC 3300

    Creator:
    Rucker, Jimmy Ivan
    Abstract:
    This thesis describes a syntax-directed compiler-compiler called COMCOM which has been implemented by the author on the CDC 3300 under the OS-3 operating system. The theory and terminology of the parsing method and compiler-compilers in general are briefly discussed. COMCOM uses Floyd's operator precedence bottom-up parsing technique which avoids backup...
    Resource Type:
    Masters Thesis
    Full Text:
    precedence grammar G2 for a restricted subset of arithmetic expressions. 11 5. An ambiguous sentence Hi i

  • Hybrid computational voxelization using the graphics pipeline

    Creator:
    Rauwendaal, Randall
    Abstract:
    This thesis presents an efficient computational voxelization approach that utilizes the graphics pipeline. Our approach is hybrid in that it performs a precise gap-free computational voxelization, employs fixed-function components of the GPU, and utilizes the stages of the graphics pipeline to improve parallelism. This approach makes use of the latest...
    Resource Type:
    Masters Thesis
    Full Text:
    exacerbated as ratio of voxel-size to triangle-size increases. . . . . . . . . 11 3.5 Na1ve rasterization