45 citations · 64 across the 6 of their papers we have counts for
6 papers
Orbitopal Fixing in SAT
Markus Anders, Cayden Codel, Marijn J. H. Heule
Despite their sophisticated heuristics, boolean satisfiability (SAT) solvers are still vulnerable to symmetry, causing them to visit search regions that are symmetric to ones alrea…
Formal Verification of the Empty Hexagon Number
Bernardo Subercaseaux, Wojciech Nawrocki, James Gallicchio +3
A recent breakthrough in computer-assisted mathematics showed that every set of points in the plane in general position (i.e., without three on a common line) contains an empt…
A Linear Weight Transfer Rule for Local Search
Md Solimul Chowdhury, Cayden R. Codel, Marijn J. H. Heule
The Divide and Distribute Fixed Weights algorithm (ddfw) is a dynamic local search SAT-solving algorithm that transfers weight from satisfied to falsified clauses in local minima.…
The MineRL 2020 Competition on Sample Efficient Reinforcement Learning using Human Priors
William H. Guss, Mario Ynocente Castro, Sam Devlin +12
Although deep reinforcement learning has led to breakthroughs in many difficult domains, these successes have required an ever-increasing number of samples, affording only a shrink…
MineRL: A Large-Scale Dataset of Minecraft Demonstrations
William H. Guss, Brandon Houghton, Nicholay Topin +4
The sample inefficiency of standard deep reinforcement learning methods precludes their application to many real-world problems. Methods which leverage human demonstrations require…
The MineRL 2019 Competition on Sample Efficient Reinforcement Learning using Human Priors
William H. Guss, Cayden Codel, Katja Hofmann +9
Though deep reinforcement learning has led to breakthroughs in many difficult domains, these successes have required an ever-increasing number of samples. As state-of-the-art reinf…