Dipl.-Inf. Adrian Balint

Projekte

EDACC - Experiment Design and Administration for Computer Cluster

Captain Jack - SLS SAT Solver

Sparrow - SLS SAT Solver

hybridGM - SLS SAT Solver

Publikationen

• Dave A. D. Tompkins, Adrian Balint, Holger H. Hoos
  Captain Jack: New Variable Selection Heuristics in Local Search for SAT
  Lecture Notes in Computer Science, 2011, Volume 6695, Theory and Applications of Satisfiability Testing - SAT 2011, Seiten 302-316
• Adrian Balint, Daniel Gall, Gregor Kapler, Robert Retz, Daniel Diepold and Simon Gerber
  EDACC - An advanced Platform for the Experiment Design, Administration and Analysis of Empirical Algorithms
  to appear int the proceedings of LION5
• Adrian Balint, Daniel Gall, Gregor Kapler, Robert Retz
  Experiment Design and Administration for Computer Cluster for SAT-solvers (EDACC), System Description
  in JSAT Volume 7
  the slides can be downloaded here
• Adrian Balint, Andreas Fröhlich
  Improving Stochastic Local Search for SAT with a New Probability Distribution
  in the proceedings of SAT2010 Springer LNCS 6175 p.10
  the slides can be downloaded here
• Adrian Balint, Michael Henn, Oliver Gableske
  A novel approach to combine a SLS- and a DPLL-solver for the satisfiability problem
  in the proceedings of SAT2009 Springer LNCS 5584 p.284
  the slides can be downloaded here (you will need the XviD codec)
• Adrian Balint
  Algorithmus von Beigel und Eppstein für das (4,2)-CSP
  Diplomarbeit, Universität Ulm (Mai 2006

Lehre

• Proseminar Algorithmen (WS10/11)
• Übungen Algorithmen und Datenstrukturen (WS10/11)
• Project SAT-Solving (SS10)
• Proseminar Algorithemn (SS10)
• Übungen Formale Grundlagen der Informatik (WS09/10)
• Project SAT-Solving (WS09/10)
• Proseminar Algorithemn (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)

Betreute Arbeiten

Diplomarbeiten

• Oliver Gableske: "Towards the development of a Hybrid SAT Solver"
• Andreas Fröhlich: "Verbesserung stochastischer lokaler Suchalgorithmen für das Erfüllbarkeitsproblem der Aussagenlogik"

Bachelorarbeiten