Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
19
click to vote
APPROX
2008
Springer
favorite
Email
discuss
report
94
views
Algorithms
»
more
APPROX 2008
»
Budgeted Allocations in the Full-Information Setting
13 years 10 months ago
Download
www.cs.umd.edu
Aravind Srinivasan
Real-time Traffic
Algorithms
|
APPROX 2008
|
claim paper
Related Content
»
Optimal Computing Budget Allocation Under Correlated Sampling
»
To BroadMatch or Not to BroadMatch An Auctioneers Dilemma
»
Optimal Computing Budget Allocation for MultiObjective Simulation Models
»
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular We...
»
Stochastic Budget Optimization in Internet Advertising
»
Optimization on a Budget A Reinforcement Learning Approach
»
Symmetric Allocations for Distributed Storage
»
Bit Allocation in Sublinear Time and the MultipleChoice Knapsack Problem
»
Near optimal online algorithms and fast approximation algorithms for resource allocation p...
more »
Post Info
More Details (n/a)
Added
12 Oct 2010
Updated
12 Oct 2010
Type
Conference
Year
2008
Where
APPROX
Authors
Aravind Srinivasan
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision