University of Cambridge > > Optimization and Incentives Seminar > Queues, Counters and Optimization

Queues, Counters and Optimization

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity