9842 search results - page 1373 / 1969 » Problem complexity |
176
click to vote
DIALM
2008
ACM
15 years 9 months ago
2008
ACM
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
213
click to vote
ATAL
2010
Springer
15 years 8 months ago
2010
Springer
We consider collusion in multi-unit auctions where the allocation and payments are determined using the VCG mechanism. We show how collusion can increase the utility of the collud...
198
click to vote
CONEXT
2009
ACM
15 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...
199
click to vote
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and...
205
Voted
GECCO
2008
Springer
15 years 8 months ago
2008
Springer
We investigate the effects of precision on the efficiency of various local search algorithms on 1-D unimodal functions. We present a (1 + 1)-EA with adaptive step size which fin...