Sciweavers

    NETWORKS
    2008
    86views Computer Networks» more  NETWORKS 2008»
    A Reach and Bound algorithm for acyclic dynamic-programming networks
    15 years 2 months ago
    A Reach and Bound algorithm for acyclic dynamic-programming networks
    Download  www-personal.umich.edu
    Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
    Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
    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.