Sciweavers

6693 search results - page 61 / 1339
» On an anytime algorithm for control
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Approximate maximum margin algorithms with rules controlled by the number of mistakes
We present a family of incremental Perceptron-like algorithms (PLAs) with margin in which both the "effective" learning rate, defined as the ratio of the learning rate t...
Petroula Tsampouka, John Shawe-Taylor
ICGA
1993
96views Optimization» more  ICGA 1993»
13 years 10 months ago
Dynamic Control of Genetic Algorithms in a Noisy Environment
In this paper, we present e cient algorithms for adjusting con guration parameters of genetic algorithms that operate in a noisy environment. Assuming that the population size is ...
Akiko N. Aizawa, Benjamin W. Wah
JSAC
2010
116views more  JSAC 2010»
13 years 4 months ago
Utility-based asynchronous flow control algorithm for wireless sensor networks
Abstract--In this paper, we formulate a flow control optimization problem for wireless sensor networks with lifetime constraint and link interference in an asynchronous setting. Ou...
Jiming Chen, WeiQiang Xu, Shibo He, Youxian Sun, P...
APIN
2000
120views more  APIN 2000»
13 years 9 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 9 months ago
Critical control of a genetic algorithm
Based on speculations coming from statistical mechanics and the conjectured existence of critical states, I propose a simple heuristic in order to control the mutation probability...
Raphaël Cerf