scientific article
From MaRDI portal
Publication:3549602
zbMath1232.68180MaRDI QIDQ3549602
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programapproximation algorithmsstochastic packingbudgeted learning problemsbudgeted multi-armed bandit problem
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Related Items (14)
Approximation algorithms for stochastic combinatorial optimization problems ⋮ Submodular Stochastic Probing on Matroids ⋮ Sensor Scheduling for Space Object Tracking and Collision Alert ⋮ ASYMPTOTICALLY OPTIMAL MULTI-ARMED BANDIT POLICIES UNDER A COST CONSTRAINT ⋮ Unnamed Item ⋮ Stochastic graph exploration with limited resources ⋮ Unnamed Item ⋮ Bandits with Global Convex Constraints and Objective ⋮ Stochastic Unsplittable Flows ⋮ Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms ⋮ Bayesian Incentive-Compatible Bandit Exploration ⋮ Stochastic graph exploration ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ Unnamed Item
This page was built for publication: