Hybrid multi-armed bandit strategies and tuned parameters make FDS 1.7-2.5x faster and improve state-of-the-art lower bounds on JSSP and RCPSP benchmarks.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks
Hybrid multi-armed bandit strategies and tuned parameters make FDS 1.7-2.5x faster and improve state-of-the-art lower bounds on JSSP and RCPSP benchmarks.