Dominik Schreiber

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 17

Top Topics

Top Venues

J. Artif. Intell. Res.

Publications

Ayal Taitler, Ron Alford, Joan Espasa, Gregor Behnke, Daniel Fiser, Michael Gimelfarb, Florian Pommerening, Scott Sanner, Enrico Scala, Dominik Schreiber, Javier Segovia-Aguas, Jendrik Seipp
The 2023 International Planning Competition. AI Mag. 45 (2) (2024)
Matthew Akram, Nikolai Maas, Peter Sanders, Dominik Schreiber
Engineering Optimal Parallel Task Scheduling. CoRR (2024)
Dominik Schreiber, Peter Sanders
Scalable SAT Solving on Demand (Abstract). HOPC@SPAA (2024)
Matthew Akram, Dominik Schreiber
Brief Announcement: New Pruning Rules for Optimal Task Scheduling on Identical Parallel Machines. SPAA (2024)
Leon Eisemann, Mirjam Fehling-Kaschek, Silke Forkert, Andreas Forster, Henrik Gommel, Susanne Guenther, Stephan Hammer, David Hermann, Marvin Klemp, Benjamin Lickert, Florian Lüttner, Robin Moss, Nicole Neis, Maria Pohle, Dominik Schreiber, Cathrina Sowa, Daniel Stadler, Janina Stompe, Michael Strobelt, David Unger, Jens R. Ziehn
A Joint Approach Towards Data-Driven Virtual Testing for Automated Driving: The AVEAS Project. CoRR (2024)
Dawn Michaelson, Dominik Schreiber, Marijn J. H. Heule, Benjamin Kiesl-Reiter, Michael W. Whalen
Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers. TACAS (1) (2023)
Peter Sanders, Dominik Schreiber
Mallob: Scalable SAT Solving On Demand With Decentralized Job Scheduling. J. Open Source Softw. 7 (77) (2022)
Peter Sanders, Dominik Schreiber
Decentralized Online Scheduling of Malleable NP-hard Jobs. Euro-Par (2022)
Dominik Schreiber, Peter Sanders
Scalable SAT Solving in the Cloud. CoRR (2022)
Dominik Schreiber, Peter Sanders
Scalable SAT Solving in the Cloud. SAT (2021)
Dominik Schreiber
Lilotane: A Lifted SAT-based Approach to Hierarchical Planning. J. Artif. Intell. Res. 70 (2021)
Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber
Finding Optimal Longest Paths by Dynamic Programming in Parallel. CoRR (2019)
Kai Fieger, Tomás Balyo, Christian Schulz, Dominik Schreiber
Finding Optimal Longest Paths by Dynamic Programming in Parallel. SOCS (2019)
Nils Christian Froleyks, Tomás Balyo, Dominik Schreiber
PASAR - Planning as Satisfiability with Abstraction Refinement. SOCS (2019)
Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo
Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. ICAPS (2019)
Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomás Balyo
Efficient SAT Encodings for Hierarchical Planning. ICAART (2) (2019)
Stefan Wilk, Dominik Schreiber, Denny Stohr, Wolfgang Effelsberg
On the effectiveness of video prefetching relying on recommender systems for mobile devices. CCNC (2016)