5153 search results - page 269 / 1031 » Introduction to Randomized Algorithms |
138
Voted
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
117
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper, we review some classical recombination operations and devise new heuristic recombinations for the fixed-length subset. Our experimental results on the cla...
132
Voted
EMO
2001
Springer
15 years 8 months ago
2001
Springer
When we try to implement a multi-objective genetic algorithm (MOGA) with variable weights for finding a set of Pareto optimal solutions, one difficulty lies in determining appropri...
138
Voted
3DIM
2001
IEEE
15 years 7 months ago
2001
IEEE
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
131
Voted
SODA
1994
ACM
15 years 5 months ago
1994
ACM
We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...