Sciweavers

925 search results - page 37 / 185
» A Solution to the Extended GCD Problem
Sort
View
ICRA
2009
IEEE
137views Robotics» more  ICRA 2009»
14 years 2 months ago
An optimized Linear Model Predictive Control solver for online walking motion generation
— 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...
Dimitar Dimitrov, Pierre-Brice Wieber, Olivier Sta...
TCOM
2011
83views more  TCOM 2011»
13 years 2 months ago
Minimizing Sum-MSE Implies Identical Downlink and Dual Uplink Power Allocations
—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...
Adam J. Tenenbaum, Raviraj S. Adve
ASP
2005
Springer
14 years 1 months ago
Applications of Preferences using Answer Set Programming
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...
Claudia Zepeda, Mauricio Osorio, Juan Carlos Nieve...
EVOW
2009
Springer
14 years 2 months ago
Improving Performance in Combinatorial Optimisation Using Averaging and Clustering
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...
Mohamed Qasem, Adam Prügel-Bennett
NIPS
2008
13 years 9 months ago
An Homotopy Algorithm for the Lasso with Online Observations
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...
Pierre Garrigues, Laurent El Ghaoui