The ComBack method revisited: caching strategies and extension with delayed duplicate detection

S. Evangelista, M. Westergaard, L.M. Kristensen

    Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

    3 Citations (Scopus)

    Abstract

    The ComBack method is a memory reduction technique for explicit state space search algorithms. It enhances hash compaction with state reconstruction to resolve hash conflicts on-the-fly thereby ensuring full coverage of the state space. In this paper we provide two means to lower the run-time penalty induced by state reconstructions: a set of strategies to implement the caching method proposed in [20], and an extension through delayed duplicate detection that allows to group reconstructions together to save redundant work.
    Original languageEnglish
    Title of host publicationTransactions on Petri Nets and Other Models of Concurrency III
    EditorsK. Jensen, J. Billington, M. Koutny
    Place of PublicationBerlin
    PublisherSpringer
    Pages189-215
    ISBN (Print)978-3-642-04854-8
    DOIs
    Publication statusPublished - 2009

    Publication series

    NameLecture Notes in Computer Science
    Volume5800
    ISSN (Print)0302-9743

    Fingerprint

    Dive into the research topics of 'The ComBack method revisited: caching strategies and extension with delayed duplicate detection'. Together they form a unique fingerprint.

    Cite this