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

|

26 views

Vitaly Kurin

Details

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

Category: NeurIPS 2020

Comments

loading...

Recommended

ICAPS 2012: Session IIIb on "Enhancing Descriptions and Improving Plans"

ICAPS | Aug 18, 2014

ICAPS 2012: Session VIa on "Probabilistic and Non-Deterministic Planning"

ICAPS | Aug 18, 2014

ICAPS 2012: Session VIIa on "Probabilistic and Non-Deterministic Planning II"

ICAPS | Aug 18, 2014

ICAPS 2012: Session VIIb on "Heuristic Search"

ICAPS | Aug 18, 2014

ICAPS 2012: Session IIIa on "Robot Path Planning"

ICAPS | Aug 18, 2014