89 search results - page 17 / 18 » Robust solutions for combinatorial auctions |
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
GECCO
2005
Springer
14 years 29 days ago
2005
Springer
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
CVPR
2004
IEEE
13 years 11 months ago
2004
IEEE
We present a simple and universal camera calibration method. Instead of extensive setups we are exploiting the accurate angular positions of fixed stars. High precision is achieve...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
COR
2006
13 years 7 months ago
2006
Starting from a given one-shot game played by a finite population of agents living in flatline, a circular or constrained grid structured by the classical definitions of neighborh...