Search Results for author:
Found 2 papers, 0 papers with code
BalMCTS: Balancing Objective Function and Search Nodes in MCTS for Constraint Optimization Problems
Constraint Optimization Problems (COP) pose intricate challenges in combinatorial problems usually addressed through Branch and Bound (B\&B) methods, which involve maintaining priority queues and iteratively selecting branches to search for solutions.
A Hierarchical Temporal Planning-Based Approach for Dynamic Hoist Scheduling Problems
Hoist scheduling has become a bottleneck in electroplating industry applications with the development of autonomous devices.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
