11345 search results - page 1811 / 2269 » Foundations of Computer Science |
133
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
In the weighted paging problem there is a weight (cost) for fetching each page into the cache. We design a randomized O(log k)-competitive online algorithm for the weighted paging...
166
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
We consider a variant of the classic multi-armed bandit problem (MAB), which we call FEEDBACK MAB, where the reward obtained by playing each of n independent arms varies according...
136
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
The following source coding problem was introduced by Birk and Kol: a sender holds a word x ∈ {0, 1}n , and wishes to broadcast a codeword to n receivers, R1, . . . , Rn. The re...
148
click to vote
FOCS
2007
IEEE
15 years 11 months ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
135
click to vote
ATAL
2007
Springer
2007
Springer
Coalition formation under uncertainty: bargaining equilibria and the Bayesian core stability concept
15 years 11 months ago
Coalition formation is a problem of great interest in AI, allowing groups of autonomous, rational agents to form stable teams. Furthermore, the study of coalitional stability conc...