5331 search results - page 260 / 1067 » Algebraic Methods for Optimization Problems |
167
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
This paper deals with transport user equilibrium. A modified version of the ant colony system is proposed where the ant colony heuristic is adapted in order to take into account a...
231
click to vote
ICMLA
2004
15 years 8 months ago
2004
: The particle swarm is one of the most powerful methods for solving global optimization problems. This method is an adaptive algorithm based on social-psychological metaphor. A po...
212
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
192
click to vote
ICCV
2009
IEEE
15 years 4 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
162
click to vote
ICCD
2004
IEEE
16 years 3 months ago
2004
IEEE
Potential slack is an effective metric of circuit’s possible performance improvement. It is equal to the maximal amount of slack that can be potentially used for optimization. I...