Sciweavers

    631 search results - page 120 / 127
    » Deriving Specifications from Requirements: An Example
    Sort
    View
    SC
    2003
    ACM
    152views Applied Computing» more  SC 2003»
    Identifying and Exploiting Spatial Regularity in Data Memory References
    13 years 12 months ago
    Identifying and Exploiting Spatial Regularity in Data Memory References
    Download  www.csl.cornell.edu
    The growing processor/memory performance gap causes the performance of many codes to be limited by memory accesses. If known to exist in an application, strided memory accesses fo...
    Tushar Mohan, Bronis R. de Supinski, Sally A. McKe...
    claim paper
    Read More »
    ICFP
    1999
    ACM
    114views Programming Languages» more  ICFP 1999»
    Type Inference Builds a Short Cut to Deforestation
    13 years 11 months ago
    Type Inference Builds a Short Cut to Deforestation
    Download  www.cs.kent.ac.uk
    Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
    Olaf Chitil
    claim paper
    Read More »
    SPLC
    2008
    115views Software Engineering» more  SPLC 2008»
    Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
    13 years 8 months ago
    Filtered Cartesian Flattening: An Approximation Technique for Optimally Selecting Features while Adhering to Resource Constraint
    Download  www.dre.vanderbilt.edu
    Software Product-lines (SPLs) use modular software components that can be reconfigured into different variants for different requirements sets. Feature modeling is a common method...
    Jules White, B. Doughtery, Douglas C. Schmidt
    claim paper
    Read More »
    CIDR
    2003
    106views Algorithms» more  CIDR 2003»
    Speculative Query Processing
    13 years 8 months ago
    Speculative Query Processing
    Download  www-db.cs.wisc.edu
    Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
    Neoklis Polyzotis, Yannis E. Ioannidis
    claim paper
    Read More »
    ALGORITHMICA
    1998
    73views more  ALGORITHMICA 1998»
    Linear Probing and Graphs
    13 years 6 months ago
    Linear Probing and Graphs
    Download  www.cs.aue.auc.dk
    Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connec...
    Donald E. Knuth
    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.