Pastāsti draugiem par šo preci:
The Design of Competitive Online Algorithms via a Primal-Dual Approach - Foundations and Trends (R) in Theoretical Computer Science Niv Buchbinder
Do you have a profile? Pierakstīties
Saņemiet paziņojumus par jauniem Niv Buchbinder izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
The Design of Competitive Online Algorithms via a Primal-Dual Approach - Foundations and Trends (R) in Theoretical Computer Science
Niv Buchbinder
Extends the primal-dual method to the setting of online algorithms, and shows its applicability to a wide variety of fundamental problems. Among the online problems considered are the weighted caching problem, generalized caching, the set-cover problem, graph optimization problems, routing, load balancing, and the problem of allocating ad-auctions.
192 pages
| Mediji | Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru) |
| Izlaists | 2009. gada 15. maijs |
| ISBN13 | 9781601982162 |
| Izdevēji | now publishers Inc |
| Lapas | 192 |
| Izmēri | 156 × 234 × 10 mm · 276 g |
| Valoda | Angļu |
