Search Constraints

Start Over
Filtering by: Creator Mateo, Jos�� A. Remove constraint Creator: Mateo, Jos�� A. Academic Affiliation Computer Science Remove constraint Academic Affiliation: Computer Science

Search Results

  • Scheduling non-uniform parallel loops on MIMD computers

    Creator:
    Liu, Jie
    Abstract:
    Parallel loops are one of the main sources of parallelism in scientific applications, and many parallel loops do not have a uniform iteration execution time. To achieve good performance for such applications on a parallel computer, iterations of a parallel loop have to be assigned to processors in such a...
    Resource Type:
    Dissertation
    Full Text:
    approved. Dr. Vikram A. Saletore. Parallel loops are one of the main sources of parallelism in

  • Properties and communication algorithms for k-ary n-cube interconnection networks

    Creator:
    Ashir, Yaagoub A.
    Abstract:
    The k-ary n-cube structure is presented in this paper for interconnecting a network of microcomputers in parallel and distributed environments. Machines based on the k-ary n-cube topology have been advocated as ideal parallel architectures for their powerful interconnecting features. In this paper, we examine the k-ary n-cube from the graph...
    Resource Type:
    Capstone Project
    Full Text:
    Interconnection Networks by Yaagoub A. Ashir A Research Paper Submitted to Partially Fulfill the Requirement

  • Parallelism in the SPI algorithm : an investigation

    Creator:
    Fountain, Tony
    Abstract:
    The Symbolic Probabilistic Inference (SPI) algorithm was developed by Bruce D' Ambrosio for efficient calculation of prior probabilities in belief nets [2]. Although the complexity of the SPI algorithm compares favorably with other approaches to probabilistic inference [5], its actual running time is still prohibitively long even for moderately sized...
    Resource Type:
    Capstone Project
    Full Text:
    Investigation By Tony Fountain A Research Paper submitted to Oregon State University in partial

  • Fault-tolerant ring embedding in De Bruijn networks

    Creator:
    Rowley, Robert A.
    Resource Type:
    Dissertation
    Full Text:
    Abstract of the Thesis of Robert A. Rowley for the degree of Doctor of Philosophy in Computer Science

  • 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:
    A linear equation model for a family of interconnection

  • A study of distance-based machine learning algorithms

    Creator:
    Wettschereck, Dietrich
    Abstract:
    Distance-based algorithms are machine learning algorithms that classify queries by computing distances between these queries and a number of internally stored exemplars. Exemplars that are closest to the query have the largest in uence on the classi cation assigned to the query. Two speci c distance-based algorithms, the nearest neighbor...
    Resource Type:
    Dissertation
    Full Text:
    the degree of Doctor of Philosophy in Computer Science presented on June 7, 1994. Title: A Study of

  • A study of model-based average reward reinforcement learning

    Creator:
    Ok, DoKyeong
    Abstract:
    Reinforcement Learning (RL) is the study of learning agents that improve their performance from rewards and punishments. Most reinforcement learning methods optimize the discounted total reward received by an agent, while, in many domains, the natural criterion is to optimize the average reward per time step. In this thesis, we...
    Resource Type:
    Dissertation
    Full Text:
    A study of model-based average reward reinforcement learning

  • Correct abstraction in counter-planning : a knowledge compilation approach

    Creator:
    Flann, Nicholas S.
    Abstract:
    Knowledge compilation improves search-intensive problem-solvers that are easily specified but inefficient. One promising approach improves efficiency by constructing a database of problem-instance/best-action pairs that replace problem-solving search with efficient lookup. The database is constructed by reverse enumeration- expanding the complete search space backwards, from the terminal problem instances. This approach...
    Resource Type:
    Dissertation
    Full Text:
    Correct abstraction in counter-planning : a knowledge

  • A feasibility study on compiling reactive problem solution methods for an Al domain

    Creator:
    Kaul, Lothar
    Abstract:
    This paper investigates the feasibility of compiling the functionality of a decision theoretic problem solving engine into a set of rules or functionally similar construct. The decision theoretic engine runs in exponential time, while the rule set runs in linear time at worst. The main question that will determine the...
    Resource Type:
    Masters Thesis
    Full Text:
    A feasibility study on compiling reactive problem solution

  • 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:
    Computers and planning : a study of the computer