Sciweavers

    1074 search results - page 54 / 215
    » Parallelizing post-placement timing optimization
    Sort
    View
    FCCM
    2005
    IEEE
    124views VLSI» more  FCCM 2005»
    Parallel Hardware Implementation of Cellular Learning Automata Based Evolutionary Computing (CLA-EC) on FPGA
    14 years 2 months ago
    Parallel Hardware Implementation of Cellular Learning Automata Based Evolutionary Computing (CLA-EC) on FPGA
    Download  ceit.aut.ac.ir
    The CLA-EC is a model obtained by combining the concepts of cellular learning automata and evolutionary algorithms. The parallel structure of the CLA-EC makes it suitable for hard...
    Arash Hariri, Reza Rastegar, Morteza Saheb Zamani,...
    claim paper
    Read More »
    JCC
    2008
    131views more  JCC 2008»
    An optimized initialization algorithm to ensure accuracy in quantum Monte Carlo calculations
    13 years 8 months ago
    An optimized initialization algorithm to ensure accuracy in quantum Monte Carlo calculations
    Download  www.wag.caltech.edu
    : Quantum Monte Carlo (QMC) calculations require the generation of random electronic configurations with respect to a desired probability density, usually the square of the magnitu...
    Daniel R. Fisher, David R. Kent IV, Michael T. Fel...
    claim paper
    Read More »
    TPDS
    1998
    124views more  TPDS 1998»
    Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
    13 years 8 months ago
    Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
    Download  www.bth.se
    —The way the processes in a parallel program are scheduled on the processors of a multiprocessor system affects the performance significantly. Finding a schedule of processes to ...
    Lars Lundberg, Håkan Lennerstad
    claim paper
    Read More »
    STOC
    1996
    ACM
    115views Algorithms» more  STOC 1996»
    Minimum Cuts in Near-Linear Time
    14 years 1 months ago
    Minimum Cuts in Near-Linear Time
    Download  www.cs.ust.hk
    We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
    David R. Karger
    claim paper
    Read More »
    FCCM
    2006
    IEEE
    106views VLSI» more  FCCM 2006»
    Scalable Hardware Architecture for Real-Time Dynamic Programming Applications
    14 years 2 months ago
    Scalable Hardware Architecture for Real-Time Dynamic Programming Applications
    Download  www.ece.utk.edu
    Abstract— This paper introduces a novel architecture for performing the core computations required by dynamic programming (DP) techniques. The latter pertain to a vast range of a...
    Brad Matthews, Itamar Elhanany
    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.