Queues, Counters and Optimization

Add to your list(s) Download to your calendar using vCal

• R. Srikant, University of Illinois at Urbana-Champaign
• Thursday 09 September 2010, 14:00-15:00
• MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge.

If you have a question about this talk, please contact Neil Walton.

Resource allocation problems in queueing networks can often be posed as convex optimization problems, and the relationship between queue lengths and Lagrange multipliers can then be used to derive optimal algorithms for routing, scheduling and flow control. In this talk, we will present applications of this theory to problems in wireless networks and online advertising with budget constraints.

This talk is part of the Optimization and Incentives Seminar series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge talks
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Economics and Computer Science Talks
• Hanchen DaDaDash
• Interested Talks
• MR12, Centre for Mathematical Sciences, Wilberforce Road, Cambridge
• Optimization and Incentives Seminar
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.