2638 search results - page 59 / 528 » Random Geometric Complexes |
118
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
138
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
146
Voted
EUROGP
2007
Springer
15 years 4 months ago
2007
Springer
Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continu...
104
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
114
Voted
EUROGP
2001
Springer
15 years 7 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...