University of Cambridge > Talks.cam > Optimization and Incentives Seminar > Queues, Counters and Optimization

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Queues, Counters and Optimization

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Hodgkin Huxley Seminar Room, Physiology Building, Department of Physiology, Development and Neuroscience. National Centre for Statistical Ecology (NCSE) Seminars Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ, Donald McIntyre Building, Room 2S4

Other talks

Group Work title and abstract tba (joint seminar with Spectral Geometry in the Clouds) Together Now: Cooperation and Collaboration in Social Art Practice Sheref Mansy, topic TBA Title to be confirmed Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity