Technical Reports from 2006

Here follows a list of all Technical Reports from 2006. By following the respective links, you can have a look at a report´s abstract or the postscript version. Generally, the abstracts are written in English, since most of the reports are in this language.

Report No.227, August 2006 (PostScript)
Jan-Georg Smaus:
Representing Boolean Functions as Linear Pseudo-Boolean Constraints
Keywords: propositional SAT solving, pseudo-Boolean constraints, Boolean functions
(Abstract)

Report No.226, August 2006 (PostScript)
K. A. Mohamed, C. Kupich:
An O(n log n) Output-Sensitive Algorithm to Detect and Resolve Conflicts for 1D Range Filters in Router Tables
Keywords: filter conflict, detection, reporting, resolving, classification, sweep-line, intervals
(Abstract)

Report No.225, August 2006 (PostScript)
C. Kupich, K. A. Mohamed:
Conflict Detection in Internet Router Tables
Keywords: filter conflict, detection, reporting, classification
(Abstract)

Report No.224, February 2006 (PostScript)
Malte Helmert, Robert Mattmüller, Gabi Röger:
Approximation Properties of Planning Benchmarks
Keywords: planning, approximation, complexity
(Abstract)

Report No.223, January 2006 (PostScript)
Jochen Eisinger, Felix Klaedtke:
Don't Care Words with an Application to the Automata-based Approach for Real Addition
Keywords: weak Buechi automata; mixed linear arithmetic over the reals and integers; don't cares
(Abstract)

Report No.222, January 2006 (PostScript)
Sebastian Kupferschmid, Joerg Hoffmann, Henning Dierks, Gerd Behrmann:
Adapting an AI Planning Heuristic for Directed Model Checking
Keywords: directed model checking, heuristic search
(Abstract)