A genetic algorithm with gene dependent mutation probability for non-stationary optimization problems (2004)
- Authors:
- USP affiliated authors: TINOS, RENATO - FFCLRP ; CARVALHO, ANDRE CARLOS PONCE DE LEON FERREIRA DE - ICMC
- Unidades: FFCLRP; ICMC
- Assunto: ALGORITMOS GENÉTICOS
- Language: Inglês
- Imprenta:
- Publisher: IEEE
- Publisher place: Los Alamitos
- Date published: 2004
- Conference titles: IEEE Congress on Evolutionary Computation
-
ABNT
TINÓS, Renato e CARVALHO, André Carlos Ponce de Leon Ferreira de. A genetic algorithm with gene dependent mutation probability for non-stationary optimization problems. 2004, Anais.. Los Alamitos: IEEE, 2004. . Acesso em: 28 mar. 2024. -
APA
Tinós, R., & Carvalho, A. C. P. de L. F. de. (2004). A genetic algorithm with gene dependent mutation probability for non-stationary optimization problems. In . Los Alamitos: IEEE. -
NLM
Tinós R, Carvalho ACP de LF de. A genetic algorithm with gene dependent mutation probability for non-stationary optimization problems. 2004 ;[citado 2024 mar. 28 ] -
Vancouver
Tinós R, Carvalho ACP de LF de. A genetic algorithm with gene dependent mutation probability for non-stationary optimization problems. 2004 ;[citado 2024 mar. 28 ] - Use of gene dependent mutation probability in evolutionary neural networks for non-stationary problems
- An evolutionary neural network for non-stationary problems
- Otimização evolutiva do conjunto de sensores utilizados por uma língua artificial
- Evolutionary computation in Brazil: a review of the literature in two databases
- Selection of sensors in an artificial tongue via genetic algorithms
- An evolutionary neural network for fault classification in non-stationary problems
- Optimal neuron selection and generalization: NK ensemble neural networks
- Computação evolutiva em ambientes dinâmicos
- A hybrid immigrants scheme for genetic algorithms in dynamic environments
- Auto-organização da população em sistemas imunológicos artificiais para otimização multimodal contínua
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas