Sciweavers

231 search results - page 16 / 47
» Computational experience with exterior point algorithms for ...
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
13 years 10 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
AOR
2010
13 years 4 months ago
Solutions diversification in a column generation algorithm
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
Nora Touati Moungla, Lucas Létocart, Anass ...
TCOM
2008
81views more  TCOM 2008»
13 years 6 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
COMGEO
2004
ACM
13 years 6 months ago
Minimal enclosing parallelepiped in 3D
We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n threedimensional points. We give two mathematical properties of these parallelepip...
Frédéric Vivien, Nicolas Wicker
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
14 years 7 days ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste