Sign in
NeurIPS 2020
Event Home
If failed to view the video, please watch on Slideslive.com
View
Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT solver?
Dec 06, 2020
|
26 views
Vitaly Kurin
Follow
Graphs
1420 videos · undefined sub area
Details
Speakers: Vitaly Kurin, Saad Godil, Shimon Whiteson, Bryan Catanzaro
Category: NeurIPS 2020
Comments
loading...
Recommended
1:04:05
ICAPS 2012: Session IIIb on "Enhancing Descriptions and Improving Plans"
ICAPS
| Aug 18, 2014
22:26
ICAPS 2012: Session VIa on "Probabilistic and Non-Deterministic Planning"
ICAPS
| Aug 18, 2014
26:28
ICAPS 2012: Session VIIa on "Probabilistic and Non-Deterministic Planning II"
ICAPS
| Aug 18, 2014
18:25
ICAPS 2012: Session VIIb on "Heuristic Search"
ICAPS
| Aug 18, 2014
42:18
ICAPS 2012: Session IIIa on "Robot Path Planning"
ICAPS
| Aug 18, 2014