Sciweavers

1184 search results - page 11 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
15 years 1 months ago
Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach
This work describes a forward-looking approach for the solution of dynamic (time-changing) problems using evolutionary algorithms. The main idea of the proposed method is to combi...
Iason Hatzakis, David Wallace
EVOW
2008
Springer
14 years 11 months ago
A Memory Enhanced Evolutionary Algorithm for Dynamic Scheduling Problems
Abstract. This paper describes a memory enhanced evolutionary algorithm (EA) approach to the dynamic job shop scheduling problem. Memory enhanced EAs have been widely investigated ...
Gregory J. Barlow, Stephen F. Smith
VLSID
2003
IEEE
103views VLSI» more  VLSID 2003»
15 years 9 months ago
Minimum Dynamic Power CMOS Circuit Design by a Reduced Constraint Set Linear Program
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
Tezaswi Raja, Vishwani D. Agrawal, Michael L. Bush...
DCC
1995
IEEE
15 years 1 months ago
Constrained-Storage Vector Quantization with a Universal Codebook
— Many image compression techniques require the quantization of multiple vector sources with significantly different distributions. With vector quantization (VQ), these sources ...
Sangeeta Ramakrishnan, Kenneth Rose, Allen Gersho
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 3 months ago
Population-based incremental learning with memory scheme for changing environments
In recent years there has been a growing interest in studying evolutionary algorithms for dynamic optimization problems due to its importance in real world applications. Several a...
Shengxiang Yang