BibTeX Export for Dagstuhl Seminar Proceedings, Volume 9491

Copy to Clipboard Download

@InProceedings{brim_et_al:DagSemProc.09491.1,
  author =	{Brim, Lubos and Edelkamp, Stefan and Hansen, Eric A. and Sanders, Peter},
  title =	{{09491 Abstracts Collection – Graph Search Engineering}},
  booktitle =	{Graph Search Engineering},
  pages =	{1--31},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9491},
  editor =	{Lubos Brim and Stefan Edelkamp and Erik A. Hansen and Peter Sanders},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09491.1},
  URN =		{urn:nbn:de:0030-drops-24315},
  doi =		{10.4230/DagSemProc.09491.1},
  annote =	{Keywords: Model Checking, Artificial Intelligence, AI Planning, State Explosion Problem, Error Detection, Protocol Analysis, Software Verification and Validation, Heuristics, Pattern/Abstraction Databases, I/O Efficient Search, Solid State Disks, GPU}
}
@InProceedings{zhou_et_al:DagSemProc.09491.2,
  author =	{Zhou, Rong and Hansen, Eric A.},
  title =	{{Dynamic State-Space Partitioning in External-Memory Graph Search}},
  booktitle =	{Graph Search Engineering},
  pages =	{1--7},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9491},
  editor =	{Lubos Brim and Stefan Edelkamp and Erik A. Hansen and Peter Sanders},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09491.2},
  URN =		{urn:nbn:de:0030-drops-24334},
  doi =		{10.4230/DagSemProc.09491.2},
  annote =	{Keywords: External-memory graph search, heuristic search}
}
@InProceedings{helmert_et_al:DagSemProc.09491.3,
  author =	{Helmert, Malte and Domshlak, Carmel},
  title =	{{Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?}},
  booktitle =	{Graph Search Engineering},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9491},
  editor =	{Lubos Brim and Stefan Edelkamp and Erik A. Hansen and Peter Sanders},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09491.3},
  URN =		{urn:nbn:de:0030-drops-24324},
  doi =		{10.4230/DagSemProc.09491.3},
  annote =	{Keywords: Planning, heuristic search, heuristic functions}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode