Sciweavers

132 search results - page 14 / 27
» Genetic Algorithm based technique for solving Chance Constra...
Sort
View
EOR
2008
200views more  EOR 2008»
13 years 7 months ago
General variable neighborhood search for the continuous optimization
We suggest a new heuristic for solving unconstrained continuous optimization problems. It is based on a generalized version of the variable neighborhood search metaheuristic. Diff...
Nenad Mladenovic, Milan Drazic, Vera Kovacevic-Vuj...
EVOW
2001
Springer
13 years 12 months ago
Autonomous Photogrammetric Network Design Using Genetic Algorithms
Abstract. This work describes the use of genetic algorithms for automating the photogrammetric network design process. When planning a photogrammetric network, the cameras should b...
Gustavo Olague
KDD
2008
ACM
140views Data Mining» more  KDD 2008»
14 years 7 months ago
On updates that constrain the features' connections during learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Jian Huang 0002
ECP
1997
Springer
128views Robotics» more  ECP 1997»
13 years 11 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
GECCO
2009
Springer
142views Optimization» more  GECCO 2009»
14 years 1 months ago
A stopping criterion based on Kalman estimation techniques with several progress indicators
The need for a stopping criterion in MOEA’s is a repeatedly mentioned matter in the domain of MOOP’s, even though it is usually left aside as secondary, while stopping criteri...
José Luis Guerrero, Jesús Garc&iacut...