Sciweavers

1972 search results - page 66 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
IOR
2008
109views more  IOR 2008»
13 years 9 months ago
Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...
Yongpei Guan, Andrew J. Miller
IJCAI
2007
13 years 10 months ago
Memory-Bounded Dynamic Programming for DEC-POMDPs
Decentralized decision making under uncertainty has been shown to be intractable when each agent has different partial information about the domain. Thus, improving the applicabil...
Sven Seuken, Shlomo Zilberstein
PPSN
2004
Springer
14 years 2 months ago
An Evolutionary Approach to Modeling Radial Brightness Distributions in Elliptical Galaxies
A reasonably good description of the luminosity profiles of galaxies is needed as it serves as a guide towards understanding the process of galaxy formation and evolution. To obtai...
Jin Li, Xin Yao, Colin Frayn, Habib G. Khosroshahi...
NETWORKS
2008
13 years 9 months ago
A Reach and Bound algorithm for acyclic dynamic-programming networks
Node pruning is a commonly used technique for solution acceleration in a dynamic programming network. In pruning, nodes are adaptively removed from the dynamic programming network...
Matthew D. Bailey, Robert L. Smith, Jeffrey M. Ald...
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
13 years 10 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...