Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 295 for “"tree search"”.

  1. Rule based stochastic tree search

    This work presents an enhancement of a search process that is suited for a problem that can be solved using a graph grammar based generative tree. Generative grammar can be used to generate a vast number of design alternatives by using a seed graph of the problem and a set of transformation rules. …

    texas Repository record for Rule based stochastic tree search (opens in a new tab)

  2. A faster game tree search algorithm

    <p>In multi-player game tree search the standard algorithm used to find an optimal move is multi-player α-β. The algorithm we propose will dominate multi-player α-β with regards to the number of leaves pruned. If the number of leaves required to be evaluated can be reduced, deeper and faster …

    ut-knoxville Repository record for A faster game tree search algorithm (opens in a new tab)

  3. On forward pruning in game-tree search

    … applications of forward pruning in game-tree search, also known as selective search. Our research focuses on three main areas: (1) Solving Tigers and Goats - using forward pruning techniques in addition to other advanced search techniques to prove that Tigers and Goats is a draw using …

    nus Repository record for On forward pruning in game-tree search (opens in a new tab) Download file for On forward pruning in game-tree search (opens in a new tab)

  4. Scalable Methods For Monte Carlo Tree Search

    Monte-Carlo Tree Search (MCTS) is a versatile and adaptive heuristic tree-search algo-rithm, designed to uncover near-optimal actions by iteratively exploring decision-making points. Through its unique balance of exploration and exploitation, MCTS progressively constructs a search tree by gathering …

    wayne-thes Repository record for Scalable Methods For Monte Carlo Tree Search (opens in a new tab)

  5. Stochastic Tree Search for Highly Coordinated Planning

    … such as exploration of unknown environments, search and rescue, and surveillance. Planning in a highly coordinated fashion causes traditional search algorithms to perform poorly as it creates combinatorial search spaces that renders exploration versus exploitation dilemma challenging as well. …

    umn Repository record for Stochastic Tree Search for Highly Coordinated Planning (opens in a new tab)

  6. Monte Carlo Tree Search: Analysis and Applications

    … perform an analysis on variations of Monte Carlo Tree Search (MCTS). The goal is to demonstrate similarities and differences in capabilities among some of the more popular variations of MCTS. Additionally, three new applications of the MCTS algorithm are proposed and analyzed: dynamic difficulty …

    guelph Repository record for Monte Carlo Tree Search: Analysis and Applications (opens in a new tab)

  7. Command generation by tree search in artificial intelligence

    … automatic controller of the TAFCOS-type as a tree-search problem in artificial intelligence. Discussion is given of earlier dynamic-optimization and optimal-control approaches. It is the purpose of this work to create a software bed for achieving, in a command generator, heuristic open-loop …

    ttu Repository record for Command generation by tree search in artificial intelligence (opens in a new tab)

  8. αβService : an asynchronous parallel tree search service for ChessGrid

    … programs depends heavily on the strength of the search algorithm used. As such, several research activities have been conducted to speed up game tree search algorithms by using parallel machines. Most of these algorithms are targeted towards shared memory models or tightly coupled systems. In …

    ubc Repository record for αβService : an asynchronous parallel tree search service for ChessGrid (opens in a new tab) Download PDF for αβService : an asynchronous parallel tree search service for ChessGrid (opens in a new tab)

  9. Real-time game agent using monte carlo tree search /

    … work investigates the application of Monte Carlo tree search (MCTS) to a real-time, high FPS Bomberman-like game, focusing on challenges such as continuous movement and simultaneous actions. The research implements a single-player MCTS tree, where opponent behaviour is simulated using predefined …

    vilnius Repository record for Real-time game agent using monte carlo tree search / (opens in a new tab)

  10. Recursive Tree Search Maximum-Likelihood Detection for Underdetermined Systems

    … its complexity. This study proposes a recursive tree search (RTS) method that significantly lowers the average complexity compared to exhaustive ML search for optimal ML decoding of underdetermined systems. The RTS approach has a straightforward structure with few parameters that require tuning, …

    queens Repository record for Recursive Tree Search Maximum-Likelihood Detection for Underdetermined Systems (opens in a new tab)

  11. RESOURCE CONSTRAINT COOPERATIVE GAME WITH MONTE CARLO TREE SEARCH

    … methodology of game theory and Monte Carlo Tree Search was developed and the hybrid methodology was tested with various case studies through the nurse scheduling problem to show that it was able to form Pareto front dominance solutions, finding feasible solutions that were optimal and finding …

    siu-theses Repository record for RESOURCE CONSTRAINT COOPERATIVE GAME WITH MONTE CARLO TREE SEARCH (opens in a new tab)

  12. Robot Planning in Adversarial Environments Using Tree Search Techniques

    … pruning strategy to improve the efficiency of a tree search algorithm. We investigate the performance limits of the asymmetric version where the adversary can inject false sensing data. We then study a reconnaissance scenario where the robot and the adversary have symmetric information. We design …

    maryland Repository record for Robot Planning in Adversarial Environments Using Tree Search Techniques (opens in a new tab)

  13. ATTACKING MULTI-LABEL AUDIO CLASSIFICATION WITH GREEDY TREE SEARCH

    … We propose modifying the novel Greedy Tree Search (GTS) attack, developed in 2023 for multi-class image classification, to attack multi-label audio classifiers. The goal test for this attack is modified to test for set differences in the top five predicted labels for audio, using …

    nps Repository record for ATTACKING MULTI-LABEL AUDIO CLASSIFICATION WITH GREEDY TREE SEARCH (opens in a new tab)

  14. Investigation of Multi-Cut Pruning in Game-Tree Search

    … chess programs are the product of decades of research which has predominantly dealt with the topic of game tree search. Consequently, there exist many search enhancement techniques for improving the effectiveness and decision quality of such programs. In this report, we give a brief historical …

    reykjavik Repository record for Investigation of Multi-Cut Pruning in Game-Tree Search (opens in a new tab)

  15. Analyses and Cost Evaluation of Code Tree Search Algorithms

    <p> Codes with a tree structure find wide use in data compression and error correction. It is generally impractical to view and weigh all the branches in a code tree, so a search algorithm is employed which considers some but not others in a predetermined fashion. Traditionally, the efficiency of …

    mcmaster Repository record for Analyses and Cost Evaluation of Code Tree Search Algorithms (opens in a new tab)

  16. INTRODUCING FUNCTIONAL MONTE CARLO TREE SEARCH METHOD FOR REINFORCEMENT LEARNING

    Monte Carlo Tree Search (MCTS) has become very influential in reinforcement learning (RL) and consequently artificial intelligence. However, these algorithms require large computational resources to generate good results and they are inflexible in terms of making dynamic corrections as decision …

    jhu Repository record for INTRODUCING FUNCTIONAL MONTE CARLO TREE SEARCH METHOD FOR REINFORCEMENT LEARNING (opens in a new tab)

  17. Neural network guided monte carlo tree search for liar's dice /

    … investigates neural network guided Monte Carlo Tree Search (MCTS) for Liar's Dice. The game is a four-player imperfect-information game where players make bids while observing only their own dice and reasoning about their opponents' hidden dice. The aim of the thesis was to implement and …

    vilnius Repository record for Neural network guided monte carlo tree search for liar's dice / (opens in a new tab)

Page 1 of 15