Search Constraints

Start Over
Filtering by: Creator Campbell, Charles T. Remove constraint Creator: Campbell, Charles T. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

Search Results

  • Automated decomposition of complex parts for manufacturing with advanced joining processes

    Creator:
    Massoni, Brandon R.
    Abstract:
    Recent advancements in joining operations and additive manufacturing now allow complex metal parts to be built up from raw materials, as opposed to being machined down from solid blocks. This not only opens up the design space, but also allows for much more efficient manufacturing. By decomposing a complex part...
    Resource Type:
    Dissertation
    Full Text:
    Abstract approved: ______________________________________________________ Matthew I. Campbell

  • Monte Carlo Tree Search with Fixed and Adaptive Abstractions

    Creator:
    Hostetler, Jesse A.
    Abstract:
    Monte Carlo tree search (MCTS) is a class of online planning algorithms for Markov decision processes (MDPs) and related models that has found success in challenging applications. In the online planning approach, the agent makes a decision in the current state by performing a limited forward search over possible futures...
    Resource Type:
    Dissertation
    Full Text:
    expected discounted sum of future rewards when following the policy, V π(s) = E [ ∞∑ t=0 γtrt ∣∣∣s, π

  • 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:
    ) distant-t placement problem: in this case, any non-resource node is at a distance of at most t from some

  • Activity recognition in desktop environments

    Creator:
    Shen, Jianqiang
    Abstract:
    Knowledge workers are struggling in the information flood. There is a growing interest in intelligent desktop environments that help knowledge workers organize their daily life. Intelligent desktop environments allow the desktop user to define a set of “activities” that characterize the user’s desktop work. These environments then attempt to identify...
    Resource Type:
    Dissertation
    Full Text:
    ., keeping track of fantasy football results). We are also interested in design- 11 ac t i v i t y a d v

  • Learning with Partial Supervision for Clustering and Classification

    Creator:
    Pei, Yuanli
    Abstract:
    In the field of machine learning, clustering and classification are two fundamental tasks. Traditionally, clustering is an unsupervised method, where no supervision about the data is available for learning; classification is a supervised task, where fully-labeled data are collected for training a classifier. In some scenarios, however, we may not...
    Resource Type:
    Dissertation
    Full Text:
    (yi|zi,xi,W, t, α) . . . . . . . . . . . . . . . . 88 4 EM Algorithm for Learning with Latent Label

  • Nonuniform Sampling Of Band-limited Functions

    Creator:
    Al-Hammali, Hussain Y.
    Abstract:
    In this thesis, we will study certain generalizations of the classical Shannon Sampling Theorem, which allows for the reconstruction of a pi-band-limited, square-integrable function from its samples on the integers. J. R. Higgins provided a generalization where the integers can be perturbed by less than 1/4, which includes nonuniform and...
    Resource Type:
    Dissertation
    Full Text:
    : If a function f is band-limited to [�⇡,⇡], i.e., it is represented as f(t) = Z ⇡ �⇡ g(x)e�ixtdx

  • Topics in toroidal interconnection networks

    Creator:
    Broeg, Robert Richard
    Resource Type:
    Dissertation
    Full Text:
    and second as the cross product of cycles. The Torus Let T be an n-dimensional torus defined over

  • Using Change Representations to Analyze Properties of Variational Software

    Creator:
    Wang, Xiangyu
    Abstract:
    Appropriate representations of variational software simplify the analysis of their properties.This thesis proposes tailored representations of two kinds variational softwares: difference files of merge commits in Git and feature models. For the former, we use the Choice Edit Model, which is based on the choice calculus, to represent changes introduced...
    Resource Type:
    Masters Thesis
    Full Text:
    new string t has updated positions, and the new position 0 is the gap before x. The delete and change

  • 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:
    function f(x). Each leaf node Xi in the finite search tree T represents a solution and has a cost

  • 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:
    pattern roo k-t a kes- kn igh t 1 , illustrated in graphical form in Figure 3.9 104 5.3 Geometric