2095 search results - page 180 / 419 » Improved pebbling bounds |
166
click to vote
COLT
2006
Springer
15 years 10 months ago
2006
Springer
We propose a sequential randomized algorithm, which at each step concentrates on functions having both low risk and low variance with respect to the previous step prediction functi...
176
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
187
click to vote
WCET
2007
15 years 7 months ago
2007
Our research focuses on formally bounded WCET analysis, where we aim to provide absolute guarantees on execution time bounds. In this paper, we describe how amortisation can be us...
144
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We study the succinctness of the complement and intersection of regular expressions. In particular, we show that when constructing a regular expression defining the compl...
177
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of dynamic spectrum sensing and access in cognitive radio systems as a partially observed Markov decision process (POMDP). A group of cognitive users cooperati...