Sciweavers

    410 search results - page 13 / 82
    » Max and min limiters
    Sort
    View
    TPDS
    2008
    92views more  TPDS 2008»
    Max-Min Fair Scheduling in Input-Queued Switches
    14 years 10 months ago
    Max-Min Fair Scheduling in Input-Queued Switches
    Download  www.ece.drexel.edu
    Fairness in traffic management can improve the isolation between traffic streams, offer a more predictable performance, eliminate transient bottlenecks, mitigate the effect of cer...
    Madhusudan Hosaagrahara, Harish Sethu
    claim paper
    Read More »
    TSP
    2008
    115views more  TSP 2008»
    Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
    14 years 10 months ago
    Approximation Bounds for Semidefinite Relaxation of Max-Min-Fair Multicast Transmit Beamforming Problem
    Download  www.ee.nthu.edu.tw
    Consider a downlink multicast scenario where a base station equipped with multiple antennas wishes to simultaneously broadcast a number of signals to some given groups of users ove...
    Tsung-Hui Chang, Zhi-Quan Luo, Chong-Yung Chi
    claim paper
    Read More »
    ACTA
    2004
    102views more  ACTA 2004»
    Approximation schemes for the Min-Max Starting Time Problem
    14 years 10 months ago
    Approximation schemes for the Min-Max Starting Time Problem
    Download  math.haifa.ac.il
    Leah Epstein, Tamir Tassa
    claim paper
    Read More »
    48
    Voted
    INFORMS
    2002
    40views more  INFORMS 2002»
    Solution of a Min-Max Vehicle Routing Problem
    14 years 9 months ago
    Solution of a Min-Max Vehicle Routing Problem
    Download  domino.research.ibm.com
    David Applegate, William J. Cook, Sanjeeb Dash, An...
    claim paper
    Read More »
    79
    Voted
    SIAMCOMP
    1998
    176views more  SIAMCOMP 1998»
    An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
    14 years 9 months ago
    An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
    Download  u.cs.biu.ac.il
    It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
    Yonatan Aumann, Yuval Rabani
    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-2025, USA.