5580 search results - page 323 / 1116 » Randomized priority algorithms |
182
click to vote
EMO
2001
Springer
15 years 11 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...
187
click to vote
3DIM
2001
IEEE
15 years 10 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...
174
click to vote
SODA
1994
ACM
15 years 8 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...
158
click to vote
AMC
2004
15 years 6 months ago
2004
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
154
click to vote
ISSAC
2007
Springer
16 years 29 days ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...