3663 search results - page 302 / 733 » Problems in the ontology of computer programs |
159
click to vote
VLSID
2007
IEEE
16 years 7 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
173
click to vote
ICRA
2009
IEEE
16 years 1 months ago
2009
IEEE
— This article addresses the fast solution of a Quadratic Program underlying a Linear Model Predictive Control scheme that generates walking motions. We introduce an algorithm wh...
200
click to vote
ICALP
1992
Springer
15 years 10 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
165
click to vote
CONSTRAINTS
1999
15 years 6 months ago
1999
Interval constraints can be used to solve problems in numerical analysis. In this paper we show that one can improve the performance of such an interval constraint program by the ...
199
click to vote
CPHYSICS
2006
15 years 6 months ago
2006
A new stochastic clustering algorithm is introduced that aims to locate all the local minima of a multidimensional continuous and differentiable function inside a bounded domain. ...