Sciweavers

    608 search results - page 2 / 122
    » On Dependent Randomized Rounding Algorithms
    Sort
    View
    ALT
    2007
    Springer
    180views Machine Learning» more  ALT 2007»
    On Calibration Error of Randomized Forecasting Algorithms
    14 years 2 months ago
    On Calibration Error of Randomized Forecasting Algorithms
    Download  www.iitp.ru
    It has been recently shown that calibration with an error less than ∆ > 0 is almost surely guaranteed with a randomized forecasting algorithm, where forecasts are obtained by...
    Vladimir V. V'yugin
    claim paper
    Read More »
    WEA
    2009
    Springer
    125views Algorithms» more  WEA 2009»
    Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching
    14 years 4 days ago
    Experimental Study of Non-oblivious Greedy and Randomized Rounding Algorithms for Hypergraph b-Matching
    Download  www.numerik.uni-kiel.de
    Lasse Kliemann, Anand Srivastav
    claim paper
    Read More »
    JACIII
    2006
    70views more  JACIII 2006»
    MDVM System Concept, Paging Latency and Round-2 Randomized Leader Election Algorithm in SG
    13 years 5 months ago
    MDVM System Concept, Paging Latency and Round-2 Randomized Leader Election Algorithm in SG
    Download  www.fujipress.jp
    Susmit Bagchi, Hafizur Rahaman, Purnendu Das
    claim paper
    Read More »
    VLSID
    2002
    IEEE
    130views VLSI» more  VLSID 2002»
    Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
    14 years 5 months ago
    Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
    Download  www.cs.york.ac.uk
    In preemptive real-time systems, a tighter estimate of the Worst Case Response Time(WCRT) of the tasks can be obtained if the layout of the tasks in memory is included in the esti...
    Anupam Datta, Sidharth Choudhury, Anupam Basu
    claim paper
    Read More »
    SIAMDM
    2002
    124views more  SIAMDM 2002»
    Scheduling Unrelated Machines by Randomized Rounding
    13 years 5 months ago
    Scheduling Unrelated Machines by Randomized Rounding
    Download  www.math.tu-berlin.de
    We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
    Andreas S. Schulz, Martin Skutella
    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.