Sciweavers

1972 search results - page 75 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
TEC
2008
165views more  TEC 2008»
13 years 9 months ago
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several app...
Shengxiang Yang, Xin Yao
SPAA
2006
ACM
14 years 3 months ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
ESOP
1999
Springer
14 years 1 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
GECCO
2007
Springer
427views Optimization» more  GECCO 2007»
14 years 3 months ago
Evolutionary music composer integrating formal grammar
—In this paper, an autonomous music composition tool is developed using Genetic Algorithms. The production is enhanced by integrating formal grammar rules. A formal grammar is a ...
Yaser M. A. Khalifa, Badar K. Khan, Jasmin Begovic...
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
14 years 2 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen