2168 search results - page 204 / 434 » Randomized Algorithms and Complexity Theory |
127
Voted
APPROX
2009
Springer
15 years 10 months ago
2009
Springer
Small-bias, or -biased, spaces have found many applications in complexity theory, coding theory, and derandomization. We generalize the notion of small-bias spaces to the setting ...
110
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i....
114
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced generalization of traditional particle swarm optimization (PSO) that applies to all combinatorial spaces. The...
181
Voted
TEC
2012
13 years 6 months ago
2012
—This paper presents a new cooperative coevolving particle swarm optimization (CCPSO) algorithm in an attempt to address the issue of scaling up particle swarm optimization (PSO)...
135
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...