Sciweavers

    EUROCAST
    2009
    Springer
    185views Hardware» more  EUROCAST 2009»
    Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
    16 years 16 days ago
    Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
    Download  www.ads.tuwien.ac.at
    The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
    Martin Gruber, Günther R. Raidl
    claim paper
    Read More »
    EUROCAST
    2009
    Springer
    143views Hardware» more  EUROCAST 2009»
    Effective Bit-Width and Under-Approximation
    16 years 16 days ago
    Effective Bit-Width and Under-Approximation
    Download  fmv.jku.at
    Robert Brummayer, Armin Biere
    claim paper
    Read More »
    « first‹ previous12
    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.