13 citations · 13 across the 2 of their papers we have counts for
3 papers · 1 filter
Choosing a Classical Planner with Graph Neural Networks
Jana Vatter, Ruben Mayer, Hans-Arno Jacobsen +2
Online planner selection is the task of choosing a solver out of a predefined set for a given planning problem. As planning is computationally hard, the performance of solvers vari…
A Vision for Semantically Enriched Data Science
Udayan Khurana, Kavitha Srinivas, Sainyam Galhotra +1
The recent efforts in automation of machine learning or data science has achieved success in various tasks such as hyper-parameter optimization or model selection. However, key are…
Search Combinators
Tom Schrijvers, Guido Tack, Pieter Wuille +2
The ability to model search in a constraint solver can be an essential asset for solving combinatorial problems. However, existing infrastructure for defining search heuristics is…