1510 search results - page 200 / 302 » Upper Probabilities and Additivity |
117
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We consider online algorithms for pull-based broadcast scheduling. In this setting there are n pages of information at a server and requests for pages arrive online. When the serv...
120
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
127
click to vote
EMSOFT
2007
Springer
15 years 10 months ago
2007
Springer
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
138
click to vote
LCTRTS
2007
Springer
15 years 10 months ago
2007
Springer
In the design of real-time and embedded systems, it is important to establish a bound on the worst-case execution time (WCET) of programs to assure via schedulability analysis tha...
134
click to vote
TCC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. As a consequence of the results by Brick...