Cited By
View all- Hanawal MDarak S(2022)Multiplayer Bandits: A Trekking ApproachIEEE Transactions on Automatic Control10.1109/TAC.2021.307745467:5(2237-2252)Online publication date: May-2022
We formulate and study a decentralized multiarmed bandit (MAB) problem. There are M distributed players competing for N independent arms. Each arm, when played, offers i.i.d. reward according to a distribution with an unknown parameter. At each time, ...
Traditional scheduling problems in stochastic queueing systems assume that the statistical parameters are known a priori. In ''Learning unknown service rates in queues: A multiarmed bandit approach'', Krishnasamy, Sen, Johari, and Shakkottai consider the ...
Consider a queueing system consisting of multiple servers. Jobs arrive over time and enter a queue for service; the goal is to minimize the size of this queue. At each opportunity for service, at most one server can be chosen, and at most one job can be ...
In this paper the block cipher RC6 is analysed. RC6 is submitted as a candidate for the Advanced Encryption Standard, and is one of five finalists. It has 128-bit blocks and supports keys of 128, 192 and 256 bits, and is an iterated 20-round block ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in