986 search results - page 107 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
121
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
136
click to vote
TACAS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. The Real-Time Calculus (RTC) [16] is a framework to analyze heterogeneous real-time systems that process event streams of data. The streams are characterized by pairs of ...
108
click to vote
PODC
2003
ACM
15 years 9 months ago
2003
ACM
Consider a dynamic, large-scale communication infrastructure (e.g., the Internet) where nodes (e.g., in a peer to peer system) can communicate only with nodes whose id (e.g., IP a...
107
Voted
SODA
2004
ACM
15 years 5 months ago
2004
ACM
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
104
Voted
RTSS
2002
IEEE
15 years 8 months ago
2002
IEEE
We present an approach to computing cyclic schedules online and in real time, while attempting to maximize a quality-of-service metric. The motivation is the detection of RF emitt...