Selected article for: "art previous state and previous state"

Author: Blum, Christian; Cotta, Carlos; Fernández, Antonio J.; Gallardo, José E.
Title: A Probabilistic Beam Search Approach to the Shortest Common Supersequence Problem
  • Cord-id: fnc53bat
  • Document date: 2007_1_1
  • ID: fnc53bat
    Snippet: The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel randomized search strategy, called probabilistic beam search (PBS), based on the hybridization between beam search and greedy constructive heuristics. PBS is competitive (and sometimes better than) previous state-of-the-art algorithms for solving the SCSP. The paper describes PBS and provides an experimental analysis (inclu
    Document: The Shortest Common Supersequence Problem (SCSP) is a well-known hard combinatorial optimization problem that formalizes many real world problems. This paper presents a novel randomized search strategy, called probabilistic beam search (PBS), based on the hybridization between beam search and greedy constructive heuristics. PBS is competitive (and sometimes better than) previous state-of-the-art algorithms for solving the SCSP. The paper describes PBS and provides an experimental analysis (including comparisons with previous approaches) that demonstrate its usefulness.

    Search related documents:
    Co phrase search for related documents
    • Try single phrases listed below for: 1