Sciweavers

3082 search results - page 20 / 617
» New Bounds for the Controller Problem
Sort
View
122
Voted
COLT
2004
Springer
15 years 7 months ago
A New PAC Bound for Intersection-Closed Concept Classes
For hyper-rectangles in Rd Auer et al. [1] proved a PAC bound of O 1 (d + log 1 ) , where and are the accuracy and confidence parameters. It is still an open question whether one...
Peter Auer, Ronald Ortner
131
Voted
COLT
1999
Springer
15 years 7 months ago
Regret Bounds for Prediction Problems
We present a unified framework for reasoning about worst-case regret bounds for learning algorithms. This framework is based on the theory of duality of convex functions. It brin...
Geoffrey J. Gordon
AUTOMATICA
2008
81views more  AUTOMATICA 2008»
15 years 3 months ago
Robust supervisory control of timed discrete event systems under partial observation based on eligible time bounds: The existenc
This paper addresses a supervisory control problem for uncertain timed discrete event systems (DESs) under partial observation. An uncertain timed DES to be controlled is represen...
Seong-Jin Park, Kwang-Hyun Cho
141
Voted
RTSS
2006
IEEE
15 years 9 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
226
Voted
CN
2007
92views more  CN 2007»
15 years 3 months ago
A new approach to dynamic bandwidth allocation in Quality of Service networks: Performance and bounds
Efficient dynamic resource provisioning algorithms are necessary to the development and automation of Quality of Service (QoS) networks. The main goal of these algorithms is to o...
Jocelyne Elias, Fabio Martignon, Antonio Capone, G...