192 search results - page 12 / 39 » Knowledge States: A Tool for Randomized Online Algorithms |
109
click to vote
SPAA
2004
ACM
15 years 3 months ago
2004
ACM
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric spa...
JUCS
2008
14 years 9 months ago
2008
: In this article we present the development of a web application called SHARP Online: An Adaptive Hypermedia System Applied to Mathematical Problem Solving. The pedagogical basis ...
127
click to vote
JMLR
2012
13 years 9 days ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
WWW
2008
ACM
15 years 10 months ago
2008
ACM
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...
BMCBI
2005
14 years 9 months ago
2005
Background: Many cutting-edge microarray analysis tools and algorithms, including commonly used limma and affy packages in Bioconductor, need sophisticated knowledge of mathematic...