Search Constraints

Start Over
Filtering by: Creator Brown, Eloise J. Remove constraint Creator: Brown, Eloise J. Committee Member Tadepalli, Prasad Remove constraint Committee Member: Tadepalli, Prasad Committee Member Dietterich, Thomas Remove constraint Committee Member: Dietterich, Thomas

Search Results

  • Adversarial planning by strategy switching in a real-time strategy game

    Creator:
    King, Brian D.
    Abstract:
    We consider the problem of strategic adversarial planning in a Real-Time Strategy (RTS) game. Strategic adversarial planning is the generation of a network of high-level tasks to satisfy goals while anticipating an adversary's actions. In this thesis we describe an abstract state and action space used for planning in an...
    Resource Type:
    Masters Thesis
    Full Text:
    state features are given in table 4.4. Kj,k indicator that opponent j is unit class k pi,j proximity of

  • Test case prioritization

    Creator:
    Malishevsky, Alexey Grigorievich
    Abstract:
    Regression testing is an expensive software engineering activity intended to provide confidence that modifications to a software system have not introduced faults. Test case prioritization techniques help to reduce regression testing cost by ordering test cases in a way that better achieves testing objectives. In this thesis, we are interested...
    Resource Type:
    Dissertation
    Full Text:
    differences between develop- ment testing and regression testing. [J . Previous test suites may be

  • 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:
    when all cliques are sorted in an order of (C1, C2, 7 Ca), then for all j > 2, there exist i < j such