6 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DS2012★ 1 cited
Pilot, Rollout and Monte Carlo Tree Search Methods for Job Shop Scheduling
Thomas Philip Runarsson, Marc Schoenauer, Michèle Sebag
Greedy heuristics may be attuned by looking ahead for each possible choice, in an approach called the rollout or Pilot method. These methods may be seen as meta-heuristics that can…
cs.NE2012★ 6 cited
An experimental study of exhaustive solutions for the Mastermind puzzle
J. J. Merelo, Antonio M. Mora, Carlos Cotta +1
Mastermind is in essence a search problem in which a string of symbols that is kept secret must be found by sequentially playing strings that use the same alphabet, and using the r…