Sciweavers

1074 search results - page 54 / 215
» Parallelizing post-placement timing optimization
Sort
View
FCCM
2005
IEEE
124views VLSI» more  FCCM 2005»
15 years 5 months ago
Parallel Hardware Implementation of Cellular Learning Automata Based Evolutionary Computing (CLA-EC) on FPGA
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,...
JCC
2008
131views more  JCC 2008»
14 years 12 months ago
An optimized initialization algorithm to ensure accuracy in quantum Monte Carlo calculations
: 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...
TPDS
1998
124views more  TPDS 1998»
14 years 11 months ago
Using Recorded Values for Bounding the Minimum Completion Time in Multiprocessors
—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
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
15 years 4 months ago
Minimum Cuts in Near-Linear Time
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
FCCM
2006
IEEE
106views VLSI» more  FCCM 2006»
15 years 6 months ago
Scalable Hardware Architecture for Real-Time Dynamic Programming Applications
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