1725 search results - page 25 / 345 » Relaxed genetic programming |
CEC
2008
IEEE
14 years 4 months ago
2008
IEEE
—Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both conti...
CP
2003
Springer
14 years 3 months ago
2003
Springer
How do we identify inconsistent CSPs quickly? This paper presents relaxation as one possible method; showing how we can generate relaxed CSPs which are easier to prove inconsistent...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
We first formulate the problem of optimally scheduling air traffic low with sector capacity constraints as a mixed integer linear program. We then use semidefinite relaxation tech...
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
GPEM
2006
13 years 10 months ago
2006
Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software ree...