On competitive recommendations (Q5964063): Difference between revisions

@@ Property / cites work @@
+A competitive analysis of the list update problem with lookahead
+Normal rank
@@ Property / cites work @@
+Tell me who I am: An interactive recommendation system
+Normal rank
@@ Property / cites work @@
+Q2921791
@@ Property / cites work: Q2921791 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5365100
@@ Property / cites work: Q5365100 / rank @@
+Normal rank
@@ Property / cites work @@
+On chromatic sums and distributed resource allocation
+Normal rank
@@ Property / cites work @@
+Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
+Normal rank
@@ Property / cites work @@
+Competitive recommendation systems
@@ Property / cites work: Competitive recommendation systems / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating min sum set cover
@@ Property / cites work: Approximating min sum set cover / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic Covering and Adaptivity
@@ Property / cites work: Stochastic Covering and Adaptivity / rank @@
+Normal rank
@@ Property / cites work @@
+Learning Binary Relations and Total Orders
@@ Property / cites work: Learning Binary Relations and Total Orders / rank @@
+Normal rank
@@ Property / cites work @@
+Q3112637
@@ Property / cites work: Q3112637 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886075
@@ Property / cites work: Q4886075 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
+Normal rank
@@ Property / cites work @@
+Learning with attribute costs
@@ Property / cites work: Learning with attribute costs / rank @@
+Normal rank
@@ Property / cites work @@
+Database Theory - ICDT 2005
@@ Property / cites work: Database Theory - ICDT 2005 / rank @@
+Normal rank