activity
20142026
most citedMonte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backups

6 citations · 15 across the 16 of their papers we have counts for

collaborators
Showing 2025Show all

5 papers · 1 filter

cs.LG2025

Neural Bayesian Filtering

Christopher Solinas, Radovan Haluska, David Sychrovsky +6

Sequential estimation under partial observability requires tracking beliefs that may be high-dimensional, multimodal, and non-Gaussian. Classical Bayesian filters generalize zero-s…

cs.AI2025

Online Submission and Evaluation System Design for Competition Operations

Zhe Chen, Daniel Harabor, Ryan Hechnenberger +1

Research communities have developed benchmark datasets across domains to compare the performance of algorithms and techniques However, tracking the progress in these research areas…

cs.AI2025

A Parallel CPU-GPU Framework for Batching Heuristic Operations in Depth-First Heuristic Search

Ehsan Futuhi, Nathan R. Sturtevant

The rapid advancement of GPU technology has unlocked powerful parallel processing capabilities, creating new opportunities to enhance classic search algorithms. This hardware has b…

cs.GT2025

Approximating Nash Equilibria in General-Sum Games via Meta-Learning

David Sychrovský, Christopher Solinas, Revan MacQueen +4

Nash equilibrium is perhaps the best-known solution concept in game theory. Such a solution assigns a strategy to each player which offers no incentive to unilaterally deviate. Whi…

cs.AI2025

Parallelizing Multi-objective A* Search

Saman Ahmadi, Nathan R. Sturtevant, Andrea Raith +2

The Multi-objective Shortest Path (MOSP) problem is a classic network optimization problem that aims to find all Pareto-optimal paths between two points in a graph with multiple ed…