5115 search results - page 727 / 1023 » On Randomized Lanczos Algorithms |
178
click to vote
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
When evaluating a heuristic for a combinatorial problem, randomly generated instances of the problem may not provide a thorough exploration of the heuristic's performance, an...
170
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
191
click to vote
ESOA
2006
15 years 10 months ago
2006
Evolutionary algorithms based on "tags" can be adapted to induce cooperation in selfish environments such as peer-to-peer systems. In this approach, nodes periodically co...
176
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Evolutionary algorithms tend to produce solutions that are not evolvable: Although current fitness may be high, further search is impeded as the effects of mutation and crossover ...
158
click to vote
COMPGEOM
2001
ACM
15 years 10 months ago
2001
ACM
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...