98 search results - page 6 / 20 » Complexity of the traveling tournament problem |
ARCS
2004
Springer
14 years 28 days ago
2004
Springer
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
GECCO
2011
Springer
12 years 11 months ago
2011
Springer
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
CG
2004
Springer
14 years 28 days ago
2004
Springer
The TAC 2003 supply-chaingame presented automated trading agents with a challenging strategic problem. Embedded within a complex stochastic environment was a pivotal strategic deci...
CONEXT
2009
ACM
13 years 8 months ago
2009
ACM
ThunderDome is a system for collaboratively measuring upload bandwidths in ad-hoc peer-to-peer systems. It works by scheduling bandwidth probes between pairs of hosts, wherein eac...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...