Sciweavers

554 search results - page 103 / 111
» Approximability of OFDMA Scheduling
Sort
View
RTSS
1999
IEEE
15 years 1 months ago
Deriving Deadlines and Periods for Real-Time Update Transactions
Typically, temporal validity of real-time data is maintained by periodic update transactions. In this paper, we examine the problem of period and deadline assignment for these upda...
Ming Xiong, Krithi Ramamritham
CLUSTER
2008
IEEE
14 years 11 months ago
Variable-grain and dynamic work generation for Minimal Unique Itemset mining
Abstract--SUDA2 is a recursive search algorithm for Minimal Unique Itemset detection. Such sets of items are formed via combinations of non-obvious attributes enabling individual r...
Paraskevas Yiapanis, David J. Haglin, Anna M. Mann...
AI
1998
Springer
14 years 9 months ago
Model-Based Average Reward Reinforcement Learning
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
Prasad Tadepalli, DoKyeong Ok
ATAL
2011
Springer
13 years 9 months ago
Quality-bounded solutions for finite Bayesian Stackelberg games: scaling up
The fastest known algorithm for solving General Bayesian Stackelberg games with a finite set of follower (adversary) types have seen direct practical use at the LAX airport for o...
Manish Jain, Christopher Kiekintveld, Milind Tambe
CORR
2012
Springer
210views Education» more  CORR 2012»
13 years 5 months ago
Stability of the Max-Weight Protocol in Adversarial Wireless Networks
In this paper we consider the MAX-WEIGHT protocol for routing and scheduling in wireless networks under an adversarial model. This protocol has received a significant amount of a...
Sungsu Lim, Kyomin Jung, Matthew Andrews