Sciweavers

184 search results - page 30 / 37
» Using FPGAs to solve the Hamiltonian cycle problem
Sort
View
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 6 months ago
Characterizing the genetic programming environment for fifth (GPE5) on a high performance computing cluster
Solving complex, real-world problems with genetic programming (GP) can require extensive computing resources. However, the highly parallel nature of GP facilitates using a large n...
Kenneth Holladay
100
Voted
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
14 years 9 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
83
Voted
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
15 years 5 months ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste
EVOW
2008
Springer
15 years 22 days ago
Particle Swarm Optimization for Tackling Continuous Review Inventory Models
We propose an alternative algorithm for solving continuous review inventory model problems for deteriorating items over a finite horizon. Our interest focuses on the case of time...
Konstantinos E. Parsopoulos, K. Skouri, Michael N....
BMCBI
2008
97views more  BMCBI 2008»
14 years 11 months ago
Quantitative analysis of numerical solvers for oscillatory biomolecular system models
Background: This article provides guidelines for selecting optimal numerical solvers for biomolecular system models. Because various parameters of the same system could have drast...
Chang F. Quo, May D. Wang