Sciweavers

732 search results - page 102 / 147
» Critical control of a genetic algorithm
Sort
View
NIPS
2001
15 years 1 months ago
Variance Reduction Techniques for Gradient Estimates in Reinforcement Learning
Policy gradient methods for reinforcement learning avoid some of the undesirable properties of the value function approaches, such as policy degradation (Baxter and Bartlett, 2001...
Evan Greensmith, Peter L. Bartlett, Jonathan Baxte...
SIGSOFT
2007
ACM
16 years 1 months ago
The impact of input domain reduction on search-based test data generation
There has recently been a great deal of interest in search? based test data generation, with many local and global search algorithms being proposed. However, to date, there has be...
Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil...
98
Voted
GECCO
2007
Springer
130views Optimization» more  GECCO 2007»
15 years 6 months ago
Variable discrimination of crossover versus mutation using parameterized modular structure
Recent work has provided functions that can be used to prove a principled distinction between the capabilities of mutation-based and crossover-based algorithms. However, prior fun...
Rob Mills, Richard A. Watson
BMCBI
2010
167views more  BMCBI 2010»
15 years 20 days ago
Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach
Background: Transcriptional gene regulation is one of the most important mechanisms in controlling many essential cellular processes, including cell development, cell-cycle contro...
Marc Bailly-Bechet, Alfredo Braunstein, Andrea Pag...
111
Voted
CEC
2009
IEEE
15 years 7 months ago
What is situated evolution?
—In this paper we discuss the notion of situated evolution. Our treatment includes positioning situated evolution on the map of evolutionary processes in terms of time- and space...
Martijn C. Schut, Evert Haasdijk, A. E. Eiben