Sciweavers

    INFOCOM
    2010
    IEEE
    178views Communications» more  INFOCOM 2010»
    Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
    13 years 10 months ago
    Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
    Download  www.columbia.edu
    —Efficient operation of wireless networks and switches requires using simple (and in some cases distributed) scheduling algorithms. In general, simple greedy algorithms (known a...
    Berk Birand, Maria Chudnovsky, Bernard Ries, Paul ...
    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.