午夜探花

(code at github)

Sparrow - SLS SAT Solver

hybridGM - SLS SAT Solver

• Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning.
  Adrian Balint, Norbert Manthey
  in Proceedings of POS2013. Slides available here.
• 
  Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti J盲rvisalo (editors)
  volume B-2013-1 of Department of Computer Science Series of Publications B, University of Helsinki, 2013. ISBN 978-952-10-8991-6. []
• 
  Adrian Balint, Uwe Sch枚ning
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., page 70. []
• 
  Adrian Balint, Norbert Manthey
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 87-88. []
• 
  Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti J盲rvisalo
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 97-98. []
• 
  Adrian Balint, Anton Belov, Marijn J.H. Heule, and Matti J盲rvisalo
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 97-98. []
• 
  Frank Mugrauer, Adrian Balint
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 115-116. []
• 
  Frank Mugrauer, Adrian Balint
  In Proceedings of SAT Competition 2013: Solver and Benchmark Descriptions., pages 117-118. []
• 
  Adrian Balint, Anton Belov, Matti J盲rvisalo, Carsten Sinz
  Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, pages 72-73 []
• 
  Adrian Balint, Anton Belov, Matti J盲rvisalo, Carsten Sinz
  Proceedings of SAT Challenge 2012: Solver and Benchmark Descriptions, pages 69-71 []
• Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
  Adrian Balint, Uwe Sch枚ning
  Lecture Notes in Computer Science, 2012, Volume 7317, Theory and Applications of Satisfiability Testing - SAT 2012, pages 16-29
• 
  Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos
  Lecture Notes in Computer Science, 2011, Volume 6695, Theory and Applications of Satisfiability Testing - SAT 2011, pages 302-316
• EDACC - An advanced Platform for the Experiment Design, Administration and Analysis of Empirical Algorithms
  Adrian Balint, Daniel Gall, Gregor Kapler, Robert Retz, Daniel Diepold and Simon Gerber
  In proceedings of LION5
• 
  Adrian Balint, Daniel Gall, Gregor Kapler, Robert Retz
  in JSAT Volume 7
  the slides can be downloaded here
• Improving Stochastic Local Search for SAT with a New Probability Distribution
  Adrian Balint, Andreas Fr枚hlich
  in the proceedings of SAT2010 Springer p.10
  the slides can be downloaded here
• A novel approach to combine a SLS- and a DPLL-solver for the satisfiability problem
  Adrian Balint, Michael Henn, Oliver Gableske
  in the proceedings of SAT2009 Springer p.284
  the slides can be downloaded here (you will need the XviD codec)
• Algorithmus von Beigel und Eppstein f眉r das (4,2)-CSP
  Adrian Balint
  Diplomarbeit, Universit盲t Ulm (Mai 2006

• Proseminar Algorithmen (WS10/11)
• 脺bungen Algorithmen und Datenstrukturen (WS10/11)
• Project SAT-Solving (SS10)
• Proseminar Algorithmen (SS10)
• 脺bungen Formale Grundlagen der Informatik (WS09/10)
• Project SAT-Solving (WS09/10)
• Proseminar Algorithmen (WS09/10)
• Project SAT-Solving + CSP (SS 09)
• Project "Effiziente Algorithmen f眉r SAT und CSP" (WS 08/09)
• 脺bungen zur Vorlesung Formale Methoden der Informatik (WS 07/08)
• 脺bungen Theoretische Informatik II (SS 07)
• Praktikum "Effiziente Algorithmen f眉r SAT und CSP" (SS 07)
• Proseminar "Algorithmen" (SS07)
• 脺bungen zur Vorlesung Formale Methoden der Informatik (WS 06/07)
• Praktikum "Effiziente Algorithmen f眉r SAT und CSP" (WS2006/07)

Diploma Theses

• Oliver Gableske: "Towards the development of a Hybrid SAT Solver"
• Andreas Fr枚hlich: "Verbesserung stochastischer lokaler Suchalgorithmen f眉r das Erf眉llbarkeitsproblem der Aussagenlogik"
• Melanie Handel: "Visualisierung und Data Mining eines hochdimensionalen Raums"

Master Theses:

• Daniel Diepold: "Model-based Parallel Automatic Algorithm Configuration"
• Simon Gerber: "Massive Parallel Algorithm Configuration"
• Juri Schulte: "Analyse von Parallelen Automatischen Algorithm-Konfiguratoren"

Bachelor Theses