Sciweavers

6393 search results - page 439 / 1279
» Randomized Algorithms on the Mesh
Sort
View
EMO
2001
Springer
109views Optimization» more  EMO 2001»
15 years 11 months ago
Specification of Genetic Search Directions in Cellular Multi-objective Genetic Algorithms
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...
Tadahiko Murata, Hisao Ishibuchi, Mitsuo Gen
3DIM
2001
IEEE
15 years 10 months ago
The Parallel Iterative Closest Point Algorithm
This paper describes a parallel implementation developed to improve the time performance of the Iterative Closest Point Algorithm. Within each iteration, the correspondence calcul...
Christian Langis, Michael A. Greenspan, Guy Godin
AMC
2004
79views more  AMC 2004»
15 years 6 months ago
Computational experience with exterior point algorithms for the transportation problem
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
Charalampos Papamanthou, Konstantinos Paparrizos, ...
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
16 years 1 months ago
Faster algorithms for the characteristic polynomial
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...
Clément Pernet, Arne Storjohann
STOC
2004
ACM
102views Algorithms» more  STOC 2004»
16 years 7 months ago
A simple polynomial-time rescaling algorithm for solving linear programs
The perceptron algorithm, developed mainly in the machine learning literature, is a simple greedy method for finding a feasible solution to a linear program (alternatively, for le...
John Dunagan, Santosh Vempala