Recomienda este artículo a tus amigos:
The Design of Competitive Online Algorithms via a Primal-Dual Approach - Foundations and Trends (R) in Theoretical Computer Science Niv Buchbinder
¿Tienes un perfil? Iniciar sesión
Recibe notificaciones sobre nuevos lanzamientos de Niv Buchbinder
Nuestros clientes opinan:
Añadir a tu lista de deseos de iMusic
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
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 15 de mayo de 2009 |
| ISBN13 | 9781601982162 |
| Editores | now publishers Inc |
| Páginas | 192 |
| Dimensiones | 156 × 234 × 10 mm · 276 g |
| Lengua | Inglés |
