Sciweavers

48 search results - page 5 / 10
» Combining cartesian genetic programming with an estimation o...
Sort
View
GECCO
2008
Springer
145views Optimization» more  GECCO 2008»
13 years 9 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
ICML
2007
IEEE
14 years 8 months ago
Combining online and offline knowledge in UCT
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
Sylvain Gelly, David Silver
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
13 years 9 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson
BMCBI
2007
153views more  BMCBI 2007»
13 years 8 months ago
Estimating genealogies from linked marker data: a Bayesian approach
Background: Answers to several fundamental questions in statistical genetics would ideally require knowledge of the ancestral pedigree and of the gene flow therein. A few examples...
Dario Gasbarra, Matti Pirinen, Mikko J. Sillanp&au...
IAT
2006
IEEE
14 years 1 months ago
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
Viswanath Avasarala, Himanshu Polavarapu, Tracy Mu...