Sciweavers

1256 search results - page 186 / 252
» Experiences with the DEVStone benchmark
Sort
View
ECML
2006
Springer
15 years 4 months ago
Active Learning with Irrelevant Examples
Abstract. Active learning algorithms attempt to accelerate the learning process by requesting labels for the most informative items first. In real-world problems, however, there ma...
Dominic Mazzoni, Kiri Wagstaff, Michael C. Burl
EMO
2006
Springer
161views Optimization» more  EMO 2006»
15 years 4 months ago
Design Issues in a Multiobjective Cellular Genetic Algorithm
In this paper we study a number of issues related to the design of a cellular genetic algorithm (cGA) for multiobjective optimization. We take as an starting point an algorithm fol...
Antonio J. Nebro, Juan José Durillo, Franci...
FPL
2006
Springer
96views Hardware» more  FPL 2006»
15 years 4 months ago
Reducing the Space Complexity of Pipelined Routing Using Modified Range Encoding
Interconnect delays are becoming an increasingly significant part of the critical path delay for circuits implemented in FPGAs. Pipelined interconnects have been proposed to addre...
Allan Carroll, Carl Ebeling
109
Voted
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
15 years 4 months ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
15 years 4 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...