NeurIPS 2020

If failed to view the video, please watch on Slideslive.com

Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT solver?

Dec 06, 2020

|

31 views

Vitaly Kurin

Details

Speakers: Vitaly Kurin, Saad Godil, Shimon Whiteson, Bryan Catanzaro

Category: NeurIPS 2020

Comments

loading...

Recommended

SREcon15 - Architecting and Launching the Halo 4 Services

USENIX | Apr 13, 2015

SREcon15 - Being Afraid—How Paranoia at Dropbox Protects Your Data

USENIX | Apr 13, 2015

ICAPS 2014: Jendrik Seipp on "Diverse and Additive Cartesian Abstraction Heuristics"

ICAPS | Apr 14, 2015

ICAPS 2014: Bram Ridder on "Heuristic Evaluation Based on Lifted Relaxed Planning Graphs"

ICAPS | Apr 14, 2015

ICAPS 2014: Richard Valenzano on "A Comparison of Knowledge-Based GBFS Enhancements and..."

ICAPS | Apr 15, 2015