Sciweavers

212 search results - page 20 / 43
» Optimal sampling of genetic algorithms on polynomial regress...
Sort
View
PKDD
2010
Springer
179views Data Mining» more  PKDD 2010»
14 years 7 months ago
Gaussian Processes for Sample Efficient Reinforcement Learning with RMAX-Like Exploration
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
Tobias Jung, Peter Stone
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 1 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
GECCO
2010
Springer
254views Optimization» more  GECCO 2010»
15 years 2 months ago
Evolutionary multi-objective optimization and decision making for selective laser sintering
This paper proposes an integrated approach to arrive at optimal build orientations, simultaneously minimizing surface roughness ‘Ra’ and build time ‘T’, for object manufac...
Nikhil Padhye, Kalyanmoy Deb
HIS
2004
14 years 11 months ago
K-Ranked Covariance Based Missing Values Estimation for Microarray Data Classification
Microarray data often contains multiple missing genetic expression values that degrade the performance of statistical and machine learning algorithms. This paper presents a K rank...
Muhammad Shoaib B. Sehgal, Iqbal Gondal, Laurence ...
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
14 years 10 months ago
Memory with memory: soft assignment in genetic programming
Based in part on observations about the incremental nature of most state changes in biological systems, we introduce the idea of Memory with Memory in Genetic Programming (GP), wh...
Nicholas Freitag McPhee, Riccardo Poli