Sciweavers

    2976 search results - page 13 / 596
    » On the bounded integer programming
    Sort
    View
    DAM
    2002
    75views more  DAM 2002»
    Cutting planes in integer and mixed integer programming
    13 years 7 months ago
    Cutting planes in integer and mixed integer programming
    Download  www.zib.de
    Hugues Marchand, Alexander Martin, Robert Weismant...
    claim paper
    Read More »
    WCET
    2003
    151views Software Engineering» more  WCET 2003»
    Fully Automatic, Parametric Worst-Case Execution Time Analysis
    13 years 9 months ago
    Fully Automatic, Parametric Worst-Case Execution Time Analysis
    Download  www.mrtc.mdh.se
    Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
    Björn Lisper
    claim paper
    Read More »
    IPPS
    1998
    IEEE
    105views Distributed And Parallel Com...» more  IPPS 1998»
    Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
    13 years 11 months ago
    Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
    Download  ipdps.cc.gatech.edu
    Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
    Peter R. Cappello, Ömer Egecioglu
    claim paper
    Read More »
    CIAC
    1997
    Springer
    111views Algorithms» more  CIAC 1997»
    A Meticulous Analysis of Mergesort Programs
    13 years 11 months ago
    A Meticulous Analysis of Mergesort Programs
    Download  www.diku.dk
    The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
    Jyrki Katajainen, Jesper Larsson Träff
    claim paper
    Read More »
    4OR
    2010
    148views more  4OR 2010»
    Point-to-point shortest paths on dynamic time-dependent road networks
    13 years 5 months ago
    Point-to-point shortest paths on dynamic time-dependent road networks
    Download  www.lix.polytechnique.fr
    This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
    Giacomo Nannicini
    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.