Search Constraints

Start Over
Filtering by: Creator Sobsey, Mark D. Remove constraint Creator: Sobsey, Mark D. Academic Affiliation Computer Science Remove constraint Academic Affiliation: Computer Science Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad

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:
    =1)=0.8 p(c=11a=0)=0.3 p(dla,b): p(d=11a=1,b=1)=0.7 p(d=11a=1,b=0)=0.5 p(d=11a=0,b=1)=0.5 p(d=11a=0,b

  • Porting and optimizing a routing library for Dataparallel C on the nCUBE 2 system

    Creator:
    Sivaramapuram, Krishna
    Abstract:
    Dataparallel C has been designed for various kinds of architectures and was devel­oped jointly at University of New Hampshire and Oregon State University. This project dealt with porting the libraries to the nCUBE 2 system and helping a user compile his programs on nCUBE 2 directly from a Sun workstation...
    Resource Type:
    Capstone Project
    Full Text:
    , Mark Clement , Phyl Crandall and Santosh Kumaran who have cleared my doubts related to this work

  • Metacontent based techniques for the regression testing of component based software : a case study

    Creator:
    Williams, Vasanth
    Abstract:
    Component based software technologies are viewed as essential for creating the software systems of the future. However, the use of externally provided component has serious drawbacks for a wide range of software engineering activities often because of a lack of information about the components. One such drawback involves validation of...
    Resource Type:
    Capstone Project
    Full Text:
    to a real component based system . 1 rl n ~ ' j 'l \ I I J l I I ) 'I d 11

  • 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:
    helped me get "logically" started on the 2-D design domain and kept asking me when I would finish

  • Metacontent based techniques for the regression testing of component based software : a case study

    Creator:
    Chattopadhyay, Soumya
    Abstract:
    Component based software technologies are viewed as essential for creating the software systems of the future. However the use of externally provided components has serious drawbacks for a wide range of software engineering activities often because of a lack of information about the components. One such drawback involves validation of...
    Resource Type:
    Capstone Project
    Full Text:
    ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) u D ~ Exit Procedure avg Sl. count= 0 S2. fread (fileptr, n) P3. while (not EOF) do P4

  • 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:
    all nodes at a distance d, (d = 1,2, , t) from A and B respectively. If SA fl SB = 0, then M = h

  • 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

  • Reinforcement learning for job-shop scheduling

    Creator:
    Zhang, Wei, 1960-
    Resource Type:
    Dissertation
    Full Text:
    developed by Mark Fox and colleagues [Fox, 1983, Fox, 1994] �rst demon- strated AI technologies in