Sciweavers

    201
    Voted
    AICT
    2005
    IEEE
    194views Communications» more  AICT 2005»
    Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
    16 years 18 days ago
    Approximations to Maximum Weight Matching Scheduling Algorithms of Low Complexity
    Download  www.clausbauer.com
    The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
    Claus Bauer
    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.