Sciweavers

    103 search results - page 1 / 21
    » Hierarchical Design of Fast Minimum Disagreement Algorithms
    Sort
    View
    GECCO
    2009
    Springer
    143views Optimization» more  GECCO 2009»
    Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
    13 years 11 months ago
    Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
    Download  www.ads.tuwien.ac.at
    The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
    Martin Gruber, Günther R. Raidl
    claim paper
    Read More »
    EUROCAST
    2009
    Springer
    185views Hardware» more  EUROCAST 2009»
    Solving the Euclidean Bounded Diameter Minimum Spanning Tree Problem by Clustering-Based (Meta-)Heuristics
    13 years 11 months 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 »
    DAC
    2006
    ACM
    141views Computer Architecture» more  DAC 2006»
    Fast algorithms for slew constrained minimum cost buffering
    14 years 5 months ago
    Fast algorithms for slew constrained minimum cost buffering
    Download  dropzone.tamu.edu
    As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
    Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K...
    claim paper
    Read More »
    JPDC
    2006
    134views more  JPDC 2006»
    Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
    13 years 4 months ago
    Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
    Download  domino.research.ibm.com
    Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
    David A. Bader, Guojing Cong
    claim paper
    Read More »
    DAC
    1998
    ACM
    175views Computer Architecture» more  DAC 1998»
    A Fast Hierarchical Algorithm for 3-D Capacitance Extraction
    14 years 5 months ago
    A Fast Hierarchical Algorithm for 3-D Capacitance Extraction
    Download  eda.ee.ucla.edu
    Weiping Shi, Jianguo Liu, Naveen Kakani, Tiejun Yu
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.