Sciweavers

    50 search results - page 2 / 10
    » Best-First Search for Treewidth
    Sort
    View
    ISVLSI
    2005
    IEEE
    115views VLSI» more  ISVLSI 2005»
    Quasi-Exact BDD Minimization Using Relaxed Best-First Search
    16 years 20 hour ago
    Quasi-Exact BDD Minimization Using Relaxed Best-First Search
    Download  www.informatik.uni-bremen.de
    In this paper we present a new method for quasiexact optimization of BDDs using relaxed ordered best-first search. This general method is applied to BDD minimization. In contrast...
    Rüdiger Ebendt, Rolf Drechsler
    claim paper
    Read More »
    172
    Voted
    KI
    2006
    Springer
    145views Artificial Intelligence» more  KI 2006»
    A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
    15 years 6 months ago
    A Framework for Quasi-exact Optimization Using Relaxed Best-First Search
    Download  www.informatik.uni-bremen.de
    Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
    Rüdiger Ebendt, Rolf Drechsler
    claim paper
    Read More »
    134
    Voted
    ICDAR
    2009
    IEEE
    206views Document Analysis» more  ICDAR 2009»
    Bayesian Best-First Search for Pattern Recognition - Application to Address Recognition
    16 years 1 months ago
    Bayesian Best-First Search for Pattern Recognition - Application to Address Recognition
    Download  www.cvc.uab.es
    Tomoyuki Hamamura, Takuma Akagi, Bunpei Irie
    claim paper
    Read More »
    110
    Voted
    AAAI
    2004
    102views Intelligent Agents» more  AAAI 2004»
    Best-First Frontier Search with Delayed Duplicate Detection
    15 years 7 months ago
    Best-First Frontier Search with Delayed Duplicate Detection
    Download  www.aaai.org
    Richard E. Korf
    claim paper
    Read More »
    122
    Voted
    IJCAI
    1989
    106views Artificial Intelligence» more  IJCAI 1989»
    Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory
    15 years 7 months ago
    Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory
    Download  ijcai.org
    Anup K. Sen, Amitava Bagchi
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.