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
|
32 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
14:30
ICAPS 2014: Vidal Alcázar on "Analyzing the Impact of Partial States..."
ICAPS
| Jul 3, 2014
13:37
ICAPS 2014: Aijun Bai on "Thompson Sampling Based Monte-Carlo Planning in POMDPs"
ICAPS
| Jul 3, 2014
23:50
ICAPS 2014: Satish Kumar on "A Tree-Based Algorithm for Construction Robots"
ICAPS
| Jul 16, 2014
25:08
ICAPS 2014: Peter Ondruska on "The Route Not Taken: Driver-Centric Estimation..."
ICAPS
| Jul 21, 2014
21:02
ICAPS 2014: Franc Ivankovic on "Optimal Planning with Global Numerical State Constraints"
ICAPS
| Jul 23, 2014