925 search results - page 37 / 185 » A Solution to the Extended GCD Problem |
131
click to vote
ICRA
2009
IEEE
15 years 10 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...
127
click to vote
TCOM
2011
14 years 11 months ago
2011
—Minimizing the sum of mean squared errors using linear transceivers under a sum power constraint in the multiuser downlink is a non-convex problem. Existing algorithms exploit a...
229
click to vote
ASP
2005
Springer
15 years 9 months ago
2005
Springer
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
117
click to vote
EVOW
2009
Springer
15 years 10 months ago
2009
Springer
In a recent paper an algorithm for solving MAX-SAT was proposed which worked by clustering good solutions and restarting the search from the closest feasible solutions. This was sh...
149
click to vote
NIPS
2008
15 years 5 months ago
2008
It has been shown that the problem of 1-penalized least-square regression commonly referred to as the Lasso or Basis Pursuit DeNoising leads to solutions that are sparse and there...