Search Constraints

Start Over
Filtering by: Creator Rossignol, P. A. Remove constraint Creator: Rossignol, P. A. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Rights Statement Copyright Not Evaluated Remove constraint Rights Statement: Copyright Not Evaluated

Search Results

  • Effects of individualized examples and personalized contexts in computer-based adaptive teaching of algebra word problems

    Creator:
    Lwo, Lwun-syin
    Abstract:
    The purpose of the present investigation was to develop an adaptive teaching model for an interactive computer-assisted instruction (CAT) program and to evaluate the effectiveness of the implementation of individualized examples or individualized examples in personalized contexts. Translating word problems into equations provided the context for the CAT investigation. Four...
    Resource Type:
    Dissertation

  • 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:
    Genetic Algorithms. Abstract approved: John P. Bolte In this work, we first introduce a novel approach

  • 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:
    belief network is a belief network in which there 3 p(a): p(a=1)=0.2 p(b): p(b=1)=0.3 p(cla): p(c=11a

  • A numerical approach to Tamme's problem in euclidean n-space

    Creator:
    Adams, Patrick Guy
    Resource Type:
    Masters Thesis
    Full Text:
    minimization of total potential energy approach by slowly increasing the inverse power p to a large number

  • 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

  • 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:
    Member (Timothy A. Budd) Committee Member (Prasad Tadepalli) uate School Representative (John P

  • Machine learning in engineering : techniques to speed up numerical optimization

    Creator:
    Cerbone, G. (Giuseppe)
    Abstract:
    Many important application problems in engineering can be formalized as nonlinear optimization tasks. However, numerical methods for solving such problems are brittle and do not scale well. For example, these methods depend critically on choosing a good starting point from which to perform the optimization search. In high-dimensional spaces, numerical...
    Resource Type:
    Dissertation
    Full Text:
    (x, y) = r21(y113)2 82 23. A point C in polar coordinates a and p 84 24. The bisector example. 84

  • 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:
    distributions whose state-spaces are subsets of the original. For example, the marginal distribution P (A

  • High-speed implementation of the RSA cryptosystem

    Creator:
    Peng, Yanqun
    Abstract:
    A public key cryptosystem allows two or more parties to securely communicate over an insecure channel without establishing a physically secure channel for key exchange. The RSA cryptosystem is the most popular public key cryptosystem ever invented. It is based on the difficulty of factoring large composite numbers. Once the...
    Resource Type:
    Masters Thesis
    Full Text:
    published. The value of d and the prime numbers p and q are kept secret. To encrypt a message M, first

  • An efficient switched capacitor buck-boost voltage regulator using delta-sigma control loop

    Creator:
    Rao, Arun
    Abstract:
    Voltage converters or charge pumps find their use in many circuits. They are extensively used in hand held devices as cell phones, pagers, PDA's and laptops. Some of the important issues relating to design of voltage regulators for handheld devices are size, efficiency and noise. Another important factor to be...
    Resource Type:
    Masters Thesis
    Full Text:
    a gain set block. The counter counts the number of skip, K and p (pumps), M. If pumps = 1 for 4