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 4 of 4 for “"Monte Carlo search"”.
-
Nested Monte Carlo Tree Search as Applied to Samurai Sudoku
… the game for interesting properties. The large search space presents a challenge for both generating and solving Sudoku puzzles without relying on techniques that simply permute a valid puzzle. These permutations result in puzzles that are essentially the same since they follow the same solution …
-
Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems
… algorithms provide a framework for using local search algorithms to address intractable discrete optimization problems. Many well-known local search algorithms can be formulated as GHC algorithms, including simulated annealing, threshold accepting, Monte Carlo search, and pure local search …
-
Assessing the Finite-Time Performance of Local Search Algorithms
… to assess a priori the effectiveness of local search algorithms, which makes the process of choosing parameters to improve their performance difficult. This dissertation introduces the B-acceptable solution probability in terms of B-acceptable solutions as a finite-time performance measure for …
-
Order-Leading Branch and Bound for Neural Network Verification
… accuracy and formal safety margins. A proposed search-based variance framework pinpoints robustness issues and distils actionable guidelines for AI pipelines. - Order-leading branch-and-bound (Oliva). Conventional sound-and-complete verifiers explore BaB subproblems equally. Oliva assigns …