Search Constraints

Start Over
Filtering by: Alternative title ssim Report no. 2186 Remove constraint Alternative title ssim: Report no. 2186 Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Decade 1990-1999 Remove constraint Decade: 1990-1999

Search Results

  • A factoring approach for probabilistic inference in belief networks

    Creator:
    Li, Zhaoyu
    Abstract:
    Reasoning about any realistic domain always involves a degree of uncertainty. Probabilistic inference in belief networks is one effective way of reasoning under uncertainty. Efficiency is critical in applying this technique, and many researchers have been working on this topic. This thesis is the report of our research in this...
    Resource Type:
    Dissertation
    Full Text:
    been working on this topic. This thesis is the report of our research in this area. This thesis

  • Investigation of automatic construction of reactive controllers

    Creator:
    Westerberg, Caryl J.
    Abstract:
    In real-time control systems, the value of a control decision depends not only on the correctness of the decision but also on the time when that decision is available. Recent work in real-time decision making has used machine learning techniques to automatically construct reactive controllers, that is, controllers with little...
    Resource Type:
    Masters Thesis
    Full Text:
    automatically construct reactive controllers, that is, controllers with little or no internal state and low

  • Optimization of seasonal irrigation scheduling by genetic algorithms

    Creator:
    Canpolat, Necati
    Abstract:
    In this work, we first introduce a novel approach to the long term irrigation scheduling using Genetic Algorithms (GAs). We explore the effectiveness of GAs in the context of optimizing nonlinear crop models and describe application requirements and implementation of the technique. GAs were found to converge quickly to near-optimal...
    Resource Type:
    Dissertation
    Full Text:
    was lengthened. Aside from crossover rate zero, no other crossover rates significantly differed. The

  • Optimal inference with local expressions

    Creator:
    Borujerdi, Mohammad
    Abstract:
    Probabilistic inference using Bayesian networks is now a well-established approach for reasoning under uncertainty. Among many e ciency-driven tech- niques which have been developed, the Optimal Factoring Problem (OFP) is distinguished for presenting a combinatorial optimization point of view on the problem. The contribution of this thesis is to extend...
    Resource Type:
    Dissertation
    Full Text:
    arithmetic operations are performed only when su�cient information is available to guarantee that no saving

  • Supporting branch-and-bound computations on parallel machines

    Creator:
    Mannan, Mohammed A.
    Abstract:
    We have developed SearchPak, a machine independent parallel searching tool on shared and distributed memory machines. It can be used for combinatorial optimiza­tion problems and OR-parallel computations as well. Both depth-first and best-first search of the state space can be performed using the SearchPak. With SearchPak, a user just provides...
    Resource Type:
    Capstone Project
    Full Text:
    this report we describe SearchPak, a domain specific package. SearchPak is a parallel searching tool

  • Topics in toroidal interconnection networks

    Creator:
    Broeg, Robert Richard
    Resource Type:
    Dissertation
    Full Text:
    nodes, X and Y, in a torus, two paths, Pl and P2, between X and Y are disjoint if they have no edge in

  • Sliding-mode control of the super maneuverable aircraft

    Creator:
    Koo, Chang Sul
    Abstract:
    In this thesis, A nonlinear methodology for the control of the highly maneuverable, high performance aircraft HARV (F-18) is studied by using sliding-mode control (SMC). This control law, which takes a continuous function when the input constraints are not considered, satisfies the reachability condition by which concerned states are driven...
    Resource Type:
    Dissertation

  • Resource placement, data rearrangement, and Hamiltonian cycles in torus networks

    Creator:
    Bae, Myung Mun
    Abstract:
    Many parallel machines, both commercial and experimental, have been/are being designed with toroidal interconnection networks. For a given number of nodes, the torus has a relatively larger diameter, but better cost/performance tradeoffs, such as higher channel bandwidth, and lower node degree, when compared to the hypercube. Thus, the torus is...
    Resource Type:
    Dissertation
    Full Text:
    an_1an_2 ao rather than n-tuples (an -1, an_2, , ao) 5 when there is no confusion. If u and v are two

  • Heuristic search in symbolic probability inference

    Creator:
    Pan, Yonghong
    Abstract:
    I present a new heuristic search approach to compute approximate answers for the probability query in belief nets. This approach can compute the 'best' bounds for a query in a period of any given time (if time permitted, it will get an exact value). It inherits the essence of Symbolic...
    Resource Type:
    Capstone Project
    Full Text:
    the nodes (marginal for those nodes with no incoming arcs, otherwise conditioned on the nodes at the

  • Porting and optimizing a routing library for C* on the iPSC/860

    Creator:
    Uberoy, Chetan
    Abstract:
    High level data-parallel languages are easy to use and shield the programmer from machine specific details. A simple and efficient way of providing an interface to such languages is to develop a machine-independent compiler and a routing library, which isolates the low-level machine dependent communication functions, The compiler translates the...
    Resource Type:
    Capstone Project
    Full Text:
    97331 uberoyc@research.cs.orst.edu A project report submitted in partial fulfillment of the