Sciweavers

220 search results - page 26 / 44
» Using genetic programming to obtain implicit diversity
Sort
View
ISNN
2005
Springer
14 years 1 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
CEC
2008
IEEE
14 years 2 months ago
A multi-agent based evolutionary algorithm in non-stationary environments
— In this paper, a multi-agent based evolutionary algorithm (MAEA) is introduced to solve dynamic optimization problems. The agents simulate living organism features and co-evolv...
Yang Yan, Hongfeng Wang, Dingwei Wang, Shengxiang ...
EPS
1998
Springer
13 years 12 months ago
Evolving Heuristics for Planning
Abstract. In this paper we describe EvoCK, a new approach to the application of genetic programming (GP) to planning. This approach starts with a traditional AI planner (PRODIGY)an...
Ricardo Aler, Daniel Borrajo, Pedro Isasi
CEC
2007
IEEE
13 years 11 months ago
Virtual reality high dimensional objective spaces for multi-objective optimization: An improved representation
This paper presents an approach for constructing improved visual representations of high dimensional objective spaces using virtual reality. These spaces arise from the solution of...
Julio J. Valdés, Alan J. Barton, Robert Orc...
GECCO
2009
Springer
131views Optimization» more  GECCO 2009»
14 years 7 days ago
Rapid prototyping using evolutionary approaches: part 1
In this paper we describe a multi-objective problem solving approach, simultaneously minimizing average surface roughness Ra and build Time T, for object manufacturing by Rapid Pr...
Nikhil Padhye, Subodh Kalia