Search Constraints

Start Over
Filtering by: Creator Knowlton, C. W. Remove constraint Creator: Knowlton, C. W. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad File Format pdf Remove constraint File Format: pdf

Search Results

  • 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:
    searching application in con- ventional C code and execute it in parallel on both shared and distributed

  • Power saving in WAP

    Creator:
    Potti, Girish
    Abstract:
    Wireless Application Protocol (WAP) is an industry standard aimed to bring the web to handheld devices. The handheld devices are constrained by battery life and it becomes important that power is conserved across web transactions. The power consumed by the handheld device is directly proportional to the time taken for...
    Resource Type:
    Capstone Project
    Full Text:
    Oregon State University Power Saving in W AP Power

  • 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:
    of a(v), then W and v are conditionally independent given c(v). 2 2.2. Symbolic Probabilistic

  • Action Segmentation in Videos: Deep Models, Prediction Diffusion, and Deep-Temporal Augmentations

    Creator:
    Aziere, Nicolas
    Abstract:
    This paper addresses the high model complexity and overconfident frame labeling of state-of-the-art (SOTA) action segmenters. Their complexity is typically justified by the need to sequentially refine action segmentation through multiple stages of a deep architecture. However, this multistage refinement does not take into account uncertainty of frame labeling predicted...
    Resource Type:
    Dissertation
    Full Text:
    computation. . . . . . . . . . . . . 10 3.1 An overview of our TCTr with the C-T-T-T-T (or CT4 for shorthand

  • Selling and buying in a distributed virtual market place

    Creator:
    Bella, Ravi
    Abstract:
    We present a model for a distributed virtual market place that can be con­structed on the Internet to support selling and buying requests, such as those found as classified advertisements. One requirement for a transaction to take place in the virtual market place is that a sell request and a...
    Resource Type:
    Capstone Project
    Full Text:
    CITIES. The root node W is at level WORLD. Nodes N1, N2, and N3 are different nations at level NATIONS