Sciweavers

4940 search results - page 544 / 988
» On the Complexity of Universal Programs
Sort
View
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
15 years 1 months ago
A fast well-conditioned interior point method for predictive control
Interior point methods (IPMs) have proven to be an efficient way of solving quadratic programming problems in predictive control. A linear system of equations needs to be solved in...
Amir Shahzad, Eric C. Kerrigan, George A. Constant...
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
15 years 1 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
TSP
2010
15 years 1 months ago
A Doppler robust max-min approach to radar code design
Abstract--This correspondence considers the problem of robust waveform design in the presence of colored Gaussian disturbance under a similarity and an energy constraint. We resort...
Antonio De Maio, Yongwei Huang, Marco Piezzo
ACL
2011
14 years 10 months ago
The Surprising Variance in Shortest-Derivation Parsing
We investigate full-scale shortest-derivation parsing (SDP), wherein the parser selects an analysis built from the fewest number of training fragments. Shortest derivation parsing...
Mohit Bansal, Dan Klein
JMLR
2012
13 years 9 months ago
SpeedBoost: Anytime Prediction with Uniform Near-Optimality
We present SpeedBoost, a natural extension of functional gradient descent, for learning anytime predictors, which automatically trade computation time for predictive accuracy by s...
Alexander Grubb, Drew Bagnell