Sciweavers

14774 search results - page 152 / 2955
» Computational complexity and evolutionary computation
Sort
View
ICNC
2005
Springer
15 years 10 months ago
A Game-Theoretic Approach for Designing Mixed Mutation Strategies
Abstract. Different mutation operators have been proposed in evolutionary programming. However, each operator may be efficient in solving a subset of problems, but will fail in an...
Jun He, Xin Yao
ICCS
2004
Springer
15 years 9 months ago
Improvements in FSM Evolutions from Partial Input/Output Sequences
This work focuses on the synthesis of finite-state machines (FSMs) by observing its input/output behaviors. Evolutionary approaches that have been proposed to solve this problem do...
Sérgio G. Araújo, Antônio C. M...
132
Voted
GECCO
2003
Springer
15 years 9 months ago
Use of Multiobjective Optimization Concepts to Handle Constraints in Single-Objective Optimization
Abstract. In this paper, we propose a new constraint-handling technique for evolutionary algorithms which is based on multiobjective optimization concepts. The approach uses Pareto...
Arturo Hernández Aguirre, Salvador Botello ...
CEC
2010
IEEE
15 years 5 months ago
Two-stage based ensemble optimization for large-scale global optimization
Large-scale global optimization (LSGO) is a very important and challenging task in optimization domain, which is embedded in many scientific and engineering applications. In this p...
Yu Wang, Bin Li
ANOR
2005
80views more  ANOR 2005»
15 years 4 months ago
Entropic Penalties in Finite Games
The main objects here are finite-strategy games in which entropic terms are subtracted from the payoffs. After such subtraction each Nash equilibrium solves an explicit, unconstra...
Sjur Didrik Flåm, E. Cavazzuti