263 search results - page 19 / 53 » Regret Bounds for Prediction Problems |
CIE
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...
105
click to vote
APLAS
2010
ACM
14 years 9 months ago
2010
ACM
Live heap space analyses have so far been concerned with the standard sequential programming model. However, that model is not very well suited for embedded real-time systems, wher...
ASPDAC
2009
ACM
15 years 6 months ago
2009
ACM
—In network-on-chip, computing worst-case delay bound for packet delivery is crucial for designing predictable systems but yet an intractable problem due to complicated resource ...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Ensuring building-block (BB) mixing is critical to the success of genetic and evolutionary algorithms. This study develops facetwise models to predict the BB mixing time and the po...
105
click to vote
COLT
2005
Springer
15 years 5 months ago
2005
Springer
We study the rank, trace-norm and max-norm as complexity measures of matrices, focusing on the problem of fitting a matrix with matrices having low complexity. We present generali...