Search Constraints

Start Over
Filtering by: Creator Mansour, M. Remove constraint Creator: Mansour, M. Degree Field Computer Science Remove constraint Degree Field: Computer Science

Search Results

  • Behaviors and strategies in end-users' collaborative programming

    Creator:
    Liu, Zheng
    Abstract:
    Traditionally, research into end-user programming has focused on how to make programming more accessible to end users conducting the programming activities all by themselves. However, few researchers have considered introducing the concept of collaborative programming into the area of end-user programming, and how the programming environments and devices should be...
    Resource Type:
    Masters Thesis
    Full Text:
    -Users' Collaborative Programming Abstract approved: argaret M. Burnett Traditionally, research into

  • Register spilling in a compiler for architectures with multiple identical functional units

    Creator:
    Goodman, Joseph M.
    Abstract:
    A good code generator must effectively utilize the registers provided by the target architecture. Although a number of register allocation techniques exist, few address the issues involved in multiple register banks and no known techniques exist for effectively using register banks of the same type that are associated with multiple...
    Resource Type:
    Capstone Project
    Full Text:
    Multiple Identical Functional Units Joseph M. Goodman Oregon State University Corvallis, Oregon March

  • Some contributions to asymmetric error control codes

    Creator:
    Elmougy, Samir
    Abstract:
    In some practical systems, most of the errors are of 1 → 0 type and 0 → 1 errors occur very rarely. In this thesis, first, the capacity of the asymmetric channel is derived. The capacity of the binary symmetric channel (BSC) and the Z-channel can be derived from this...
    Resource Type:
    Dissertation
    Full Text:
    systematic t-unidirectional error detecting codes over Zm, m > 2 is designed. These codes can detect 2

  • Communication-Efficient Secure Two-Party Computation From Minicrypt and OT

    Creator:
    Roy, Lawrence
    Abstract:
    Secure two-party computation (2PC) is the task of performing arbitrary calculations on secret inputs provided by two parties, while maintaining secrecy if at least one party is honest. 2PC has been applied to privacy-preserving record linkage and machine learning, in areas such as medicine where maintaining privacy is crucial. One...
    Resource Type:
    Dissertation
    Full Text:
    Ideal Cipher (EKE) . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 3.5.2 Even-Mansour POPF

  • Model-based approximation methods for reinforcement learning

    Creator:
    Wang, Xin
    Abstract:
    The thesis focuses on model-based approximation methods for reinforcement learning with large scale applications such as combinatorial optimization problems. First, the thesis proposes two new model-based methods to stablize the value–function approximation for reinforcement learning. The first one is the BFBP algorithm, a batch-like reinforcement learning process which iterates between...
    Resource Type:
    Dissertation
    Full Text:
    Lipschitz Continuity of ∇M ∞ θk J(θk) . . . . . . . . . 199 LIST OF FIGURES Figure Page 2.1 Performance

  • Simulator-Defined MDP Planning with Applications in Natural Resource Management

    Creator:
    Alkaee Taleghan, Majid
    Abstract:
    This work is inspired by problems in natural resource management centered on the challenge of invasive species. Computing optimal management policies for maintaining ecosystem sustainable is challenging. Many ecosystem management problems can be formulated as MDP (Markov Decision Process) planning problems. In a simulator-defined MDP, the Markovian dynamics and rewards...
    Resource Type:
    Dissertation
    Full Text:
    intervals via value iteration. Specifically, Even- Dar, Mannor, and Mansour [17] apply the Hoeffding bound

  • Average-reward reinforcement learning for product delivery by multiple vehicles

    Creator:
    Tang, Hong
    Abstract:
    Real time delivery of products is the context of stochastic demands and multiple vehicles is a difficult problem as it requires the joint investigation of the problems in inventory control and vehicle routing. We model this problem in the framework of Average reward Reinforcement Learning (ARL) and present experimental results...
    Resource Type:
    Capstone Project
    Full Text:
    represent the h-function, where k is the number of 31 trucks and m is the total number of nodes in the

  • Leveraging Compressive Sampling and Machine Learning for Adaptive and Cooperative Wideband Spectrum Sensing

    Creator:
    Zaid, Adem
    Abstract:
    This thesis proposes a novel technique that exploits spectrum occupancy behaviors inherent to wideband spectrum access to enable efficient cooperative spectrum sensing. The proposed technique reduces the number of required sensing measurements while accurately recovering spectrum occupancy information. It does so by leveraging compressive sampling theory to exploit the block-like...
    Resource Type:
    Masters Thesis
    Full Text:
    allow sampling at sub-Nyquist rates [48]. That is, by taking a 5 number of measurements m(k) ≥ O(k

  • UCT for tactical assault battles in real-time strategy games

    Creator:
    Balla, Radha-Krishna
    Abstract:
    We consider the problem of tactical assault planning in real-time strategy games where a team of friendly agents must launch an assault on an enemy. This problem offers many challenges including a highly dynamic and uncertain environment, multiple agents, durative actions, numeric attributes, and different optimization objectives. While the dynamics...
    Resource Type:
    Masters Thesis
    Full Text:
    friendly groups and m enemy groups, the number of action choices would be, 𝑁𝑢𝑚𝑏𝑒𝑟 𝑜𝑓

  • Methods for cost-sensitive learning

    Creator:
    Margineantu, Dragos D.
    Abstract:
    Many approaches for achieving intelligent behavior of automated (computer) systems involve components that learn from past experience. This dissertation studies computational methods for learning from examples, for classification and for decision making, when the decisions have different non-zero costs associated with them. Many practical applications of learning algorithms, including transaction...
    Resource Type:
    Dissertation
    Full Text:
    with m the number of training instances. The Cost Matrix The algorithms described in this thesis