Sciweavers

    2814 search results - page 22 / 563
    » Competitive Analysis of Distributed Algorithms
    Sort
    View
    IPPS
    1998
    IEEE
    82views Distributed And Parallel Com...» more  IPPS 1998»
    A Quantitative Code Analysis of Scientific Systolic Programs: DSP vs. Matrix Algorithms
    14 years 26 days ago
    A Quantitative Code Analysis of Scientific Systolic Programs: DSP vs. Matrix Algorithms
    Download  ipdps.cc.gatech.edu
    R. Sernec, M. Zajc, Jurij F. Tasic
    claim paper
    Read More »
    IPPS
    1993
    IEEE
    73views Distributed And Parallel Com...» more  IPPS 1993»
    A Probabilistic Analysis of a Locality Maintaining Load Balancing Algorithm
    14 years 22 days ago
    A Probabilistic Analysis of a Locality Maintaining Load Balancing Algorithm
    Download  grids.ucs.indiana.edu
    Kishan Mehrotra, Sanjay Ranka, Jhy-Chun Wang
    claim paper
    Read More »
    ICS
    1992
    Tsinghua U.
    92views Distributed And Parallel Com...» more  ICS 1992»
    A general algorithm for data dependence analysis
    14 years 20 days ago
    A general algorithm for data dependence analysis
    Download  www.iis.nsk.su
    Christine Eisenbeis, Jean-Claude Sogno
    claim paper
    Read More »
    SPAA
    2004
    ACM
    149views Distributed And Parallel Com...» more  SPAA 2004»
    Online algorithms for prefetching and caching on parallel disks
    14 years 2 months ago
    Online algorithms for prefetching and caching on parallel disks
    Download  www.ittc.ku.edu
    Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
    Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
    claim paper
    Read More »
    CSC
    2009
    182views Applied Computing» more  CSC 2009»
    An Empirical Analysis of Approximation Algorithms for Euclidean TSP
    13 years 9 months ago
    An Empirical Analysis of Approximation Algorithms for Euclidean TSP
    Download  www.exa.unicen.edu.ar
    - The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
    Bárbara Rodeker, M. Virginia Cifuentes, Lil...
    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.