|
Search the dblp DataBase
Sebastian Kupferschmid:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jörg Hoffmann, Sebastian Kupferschmid
A Covering Problem for Hypercubes. [Citation Graph (0, 0)][DBLP] IJCAI, 2005, pp:1523-1524 [Conf]
- Sebastian Kupferschmid, Jörg Hoffmann, Henning Dierks, Gerd Behrmann
Adapting an AI Planning Heuristic for Directed Model Checking. [Citation Graph (0, 0)][DBLP] SPIN, 2006, pp:35-52 [Conf]
- Sebastian Kupferschmid, Malte Helmert
A Skat Player Based on Monte-Carlo Simulation. [Citation Graph (0, 0)][DBLP] Computers and Games, 2006, pp:135-147 [Conf]
- Henning Dierks, Sebastian Kupferschmid, Kim Guldstrand Larsen
Automatic Abstraction Refinement for Timed Automata. [Citation Graph (0, 0)][DBLP] FORMATS, 2007, pp:114-129 [Conf]
- Sebastian Kupferschmid, Klaus Dräger, Jörg Hoffmann, Bernd Finkbeiner, Henning Dierks, Andreas Podelski, Gerd Behrmann
Uppaal/DMC- Abstraction-Based Heuristics for Directed Model Checking. [Citation Graph (0, 0)][DBLP] TACAS, 2007, pp:679-682 [Conf]
- Jörg Hoffmann, Jan-Georg Smaus, Andrey Rybalchenko, Sebastian Kupferschmid, Andreas Podelski
Using Predicate Abstraction to Generate Heuristic Functions in UPPAAL. [Citation Graph (0, 0)][DBLP] MoChArt, 2006, pp:51-66 [Conf]
Useless Actions Are Useful. [Citation Graph (, )][DBLP]
Faster Than Uppaal? [Citation Graph (, )][DBLP]
Automatic Bidding for the Game of Skat. [Citation Graph (, )][DBLP]
Transition-Based Directed Model Checking. [Citation Graph (, )][DBLP]
Fast Directed Model Checking Via Russian Doll Abstraction. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|