Sciweavers

263 search results - page 24 / 53
» Regret Bounds for Prediction Problems
Sort
View
RTSS
2006
IEEE
14 years 3 months ago
Tightening the Bounds on Feasible Preemption Points
Caches have become invaluable for higher-end architectures to hide, in part, the increasing gap between processor speed and memory access times. While the effect of caches on timi...
Harini Ramaprasad, Frank Mueller
CDC
2008
IEEE
112views Control Systems» more  CDC 2008»
14 years 4 months ago
Application of the proximal center decomposition method to distributed model predictive control
Abstract— In this paper we present a dual-based decomposition method, called here the proximal center method, to solve distributed model predictive control (MPC) problems for cou...
Ion Necoara, Dang Doan, Johan A. K. Suykens
NIPS
2007
13 years 11 months ago
Stability Bounds for Non-i.i.d. Processes
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
Mehryar Mohri, Afshin Rostamizadeh
CDC
2008
IEEE
115views Control Systems» more  CDC 2008»
14 years 4 months ago
Min-Max predictive control of a pilot plant using a QP approach
— The practical implementation of Min-Max MPC (MMMPC) controllers is limited by the computational burden required to compute the control law. This problem can be circumvented by ...
Jorn Klaas Gruber, Daniel R. Ramírez, Teodo...
CLUSTER
2008
IEEE
14 years 4 months ago
Empirical-based probabilistic upper bounds for urgent computing applications
—Scientific simulation and modeling often aid in making critical decisions in such diverse fields as city planning, severe weather prediction and influenza modeling. In some o...
Nick Trebon, Peter H. Beckman