1233 search results - page 138 / 247 » Extensible Point Location Algorithm |
133
click to vote
ICANN
2005
Springer
15 years 10 months ago
2005
Springer
The power iteration is a classical method for computing the eigenvector associated with the largest eigenvalue of a matrix. The subspace iteration is an extension of the power iter...
167
Voted
GECCO
2004
Springer
2004
Springer
Using Clustering Techniques to Improve the Performance of a Multi-objective Particle Swarm Optimizer
15 years 10 months ago
In this paper, we present an extension of the heuristic called “particle swarm optimization” (PSO) that is able to deal with multiobjective optimization problems. Our approach ...
156
click to vote
ARITH
2003
IEEE
15 years 10 months ago
2003
IEEE
The quotient digit selection in the SRT division algorithm is based on a few most significant bits of the remainder and divisor, where the remainder is usually represented in a r...
122
click to vote
ICRA
1994
IEEE
15 years 8 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
144
click to vote
AAAI
2000
15 years 6 months ago
2000
Monte Carlo localization (MCL) is a Bayesian algorithm for mobile robot localization based on particle filters, which has enjoyed great practical success. This paper points out a ...