5995 search results - page 399 / 1199 » Algorithmic Game Theory |
137
click to vote
ECCC
2006
15 years 6 months ago
2006
Ant Colony Optimization (ACO) has become quite popular in recent years. In contrast to many successful applications, the theoretical foundation of this randomized search heuristic...
160
click to vote
MOC
2000
15 years 6 months ago
2000
Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...
160
click to vote
GECCO
2007
Springer
16 years 1 months ago
2007
Springer
We analyze the performance of evolutionary algorithms on various matroid optimization problems that encompass a vast number of efficiently solvable as well as NP-hard combinatoria...
193
click to vote
GECCO
2005
Springer
16 years 12 days ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
186
click to vote
SPAA
2004
ACM
16 years 9 days ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...