Sciweavers

1184 search results - page 12 / 237
» Memory Design for Constrained Dynamic Optimization Problems
Sort
View
DAC
2006
ACM
15 years 10 months ago
Fast algorithms for slew constrained minimum cost buffering
As a prevalent constraint, sharp slew rate is often required in circuit design which causes a huge demand for buffering resources. This problem requires ultra-fast buffering techn...
Shiyan Hu, Charles J. Alpert, Jiang Hu, Shrirang K...
110
Voted
MP
2011
14 years 4 months ago
A first-order interior-point method for linearly constrained smooth optimization
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
Paul Tseng, Immanuel M. Bomze, Werner Schachinger
ICML
1998
IEEE
15 years 10 months ago
Q2: Memory-Based Active Learning for Optimizing Noisy Continuous Functions
This paper introduces a new algorithm, Q2, foroptimizingthe expected output ofamultiinput noisy continuous function. Q2 is designed to need only a few experiments, it avoids stron...
Andrew W. Moore, Jeff G. Schneider, Justin A. Boya...
ISDA
2008
IEEE
15 years 3 months ago
Cultural-Based Genetic Algorithm: Design and Real World Applications
Due to their excellent performance in solving combinatorial optimization problems, metaheuristics algorithms such as Genetic Algorithms (GA), Simulated Annealing (SA) and Tabu Sea...
Mostafa A. El-Hosseini, Aboul Ella Hassanien, Ajit...
GECCO
2008
Springer
199views Optimization» more  GECCO 2008»
14 years 10 months ago
Analysis of multi-objective evolutionary algorithms to optimize dynamic data types in embedded systems
New multimedia embedded applications are increasingly dynamic, and rely on Dynamically-allocated Data Types (DDTs) to store their data. The optimization of DDTs for each target em...
José Ignacio Hidalgo, José L. Risco-...