Sciweavers

1356 search results - page 114 / 272
» Some New Results on Inverse Sorting Problems
Sort
View
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
13 years 10 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein
ANOR
2002
100views more  ANOR 2002»
13 years 9 months ago
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization
A new algorithm for solving smooth large-scale minimization problems with bound constraints is introduced. The way of dealing with active constraints is similar to the one used in...
Oleg P. Burdakov, José Mario Martíne...
PR
2000
92views more  PR 2000»
13 years 8 months ago
On the independence of rotation moment invariants
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...
Jan Flusser
ICRA
2010
IEEE
120views Robotics» more  ICRA 2010»
13 years 7 months ago
Approximation of feasibility tests for reactive walk on HRP-2
— We present here an original approach to test the feasibility of footsteps for a given walking pattern generator. It is based on a new approximation algorithm intended to cope w...
Nicolas Perrin, Olivier Stasse, Florent Lamiraux, ...
HIS
2009
13 years 6 months ago
Probability Diffused Particle Swarm Optimization
Premature convergence is a major problem of Particle Swarm Optimization (PSO).Although many strategies have been proposed, there is still some work needed to do in high-dimensional...
Qiuyan Qin, Zhihua Cui, Jianchao Zeng