Pages that link to "Item:Q5506116"

The following pages link to PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH (Q5506116):

Displaying 17 items.

• Adaptive playouts for online learning of policies during Monte Carlo tree search (Q307776) (← links)
• An analysis for strength improvement of an MCTS-based program playing Chinese dark chess (Q307781) (← links)
• Using evaluation functions in Monte-Carlo tree search (Q307789) (← links)
• Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information (Q464622) (← links)
• Multi-armed bandits with episode context (Q766259) (← links)
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
• A game-based approximate verification of deep neural networks with provable guarantees (Q2286751) (← links)
• Reasoning about uncertain parameters and agent behaviors through encoded experiences and belief planning (Q2302297) (← links)
• Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis (Q2330543) (← links)
• Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search (Q2795793) (← links)
• Efficiency of Static Knowledge Bias in Monte-Carlo Tree Search (Q2947905) (← links)
• MoHex 2.0: A Pattern-Based MCTS Hex Player (Q2947907) (← links)
• Amazons Discover Monte-Carlo (Q3601816) (← links)
• Monte-Carlo Tree Search Solver (Q3601818) (← links)
• (Q4636970) (← links)
• On Monte-Carlo tree search for deterministic games with alternate moves and complete information (Q4967797) (← links)
• Scalable Online Planning for Multi-Agent MDPs (Q5076326) (← links)