Sciweavers

1972 search results - page 88 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 11 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
GECCO
2006
Springer
185views Optimization» more  GECCO 2006»
14 years 27 days ago
Memory analysis and significance test for agent behaviours
Many agent problems in a grid world have a restricted sensory information and motor actions. The environmental conditions need dynamic processing of internal memory. In this paper...
DaeEun Kim
GECCO
2007
Springer
210views Optimization» more  GECCO 2007»
14 years 3 months ago
An application of EDA and GA to dynamic pricing
E-commerce has transformed the way firms develop their pricing strategies, producing shift away from fixed pricing to dynamic pricing. In this paper, we use two different Estim...
Siddhartha Shakya, Fernando Oliveira, Gilbert Owus...
ICML
2005
IEEE
14 years 10 months ago
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
H. Brendan McMahan, Maxim Likhachev, Geoffrey J. G...
ICML
1995
IEEE
14 years 10 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon