Sciweavers

    50 search results - page 3 / 10
    » jsa 2006
    Sort
    View
    JSA
    2002
    77views more  JSA 2002»
    NULL convention multiply and accumulate unit with conditional rounding, scaling, and saturation
    13 years 5 months ago
    NULL convention multiply and accumulate unit with conditional rounding, scaling, and saturation
    Download  comp.uark.edu
    Scott C. Smith, Ronald F. DeMara, Jiann S. Yuan, M...
    claim paper
    Read More »
    JSA
    2006
    108views more  JSA 2006»
    Improved composite confidence mechanisms for a perceptron branch predictor
    13 years 5 months ago
    Improved composite confidence mechanisms for a perceptron branch predictor
    Download  escher.elis.ugent.be
    In 2001, Jime
    Veerle Desmet, Lieven Eeckhout, Koen De Bosschere
    claim paper
    Read More »
    JSA
    2006
    52views more  JSA 2006»
    Intelligent memory manager: Reducing cache pollution due to memory management functions
    13 years 5 months ago
    Intelligent memory manager: Reducing cache pollution due to memory management functions
    Download  csrl.unt.edu
    In this work, we show that data-intensive and frequently-used service functions such as memory allocation and deallocation entangle with application
    Mehran Rezaei, Krishna M. Kavi
    claim paper
    Read More »
    JSA
    2000
    116views more  JSA 2000»
    A fault tolerant routing algorithm based on cube algebra for hypercube systems
    13 years 5 months ago
    A fault tolerant routing algorithm based on cube algebra for hypercube systems
    Download  ube.ege.edu.tr
    We propose an approach to determine the shortest path between the source and the destination nodes in a faulty or a nonfaulty hypercube. The number of faulty nodes and links may b...
    Novruz M. Allahverdi, Sirzad S. Kahramanli, Kayhan...
    claim paper
    Read More »
    JSA
    2000
    103views more  JSA 2000»
    O(n) routing in rearrangeable networks
    13 years 5 months ago
    O(n) routing in rearrangeable networks
    Download  www.isical.ac.in
    In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets...
    Nabanita Das, Krishnendu Mukhopadhyaya, Jayasree D...
    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.