Sciweavers

1213 search results - page 115 / 243
» Approximation in quantale-enriched categories
Sort
View
SAC
2009
ACM
15 years 5 months ago
A gradient oriented recombination scheme for evolution strategies
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
Haifeng Chen, Guofei Jiang
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 5 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
ICDM
2009
IEEE
105views Data Mining» more  ICDM 2009»
15 years 5 months ago
Multi-document Summarization by Information Distance
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li
ATAL
2009
Springer
15 years 5 months ago
Online exploration in least-squares policy iteration
One of the key problems in reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large or even continuous Markov decision processes (...
Lihong Li, Michael L. Littman, Christopher R. Mans...
ATAL
2009
Springer
15 years 5 months ago
SarsaLandmark: an algorithm for learning in POMDPs with landmarks
Reinforcement learning algorithms that use eligibility traces, such as Sarsa(λ), have been empirically shown to be effective in learning good estimated-state-based policies in pa...
Michael R. James, Satinder P. Singh