Isbn: 9783639409772 - scheduling and flow-related problems in networks: algorithms and complexity (9 resultados)

- Tapa blanda
Librería: Books Puddle, Woodside, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 80,85
Envío por EUR 3,52Se envía dentro de Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New.

- Tapa blanda
Librería: Mispah books, Redhill, SURRE, Reino UnidoMispah books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 171,83
Envío por EUR 29,17Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponible
paperback. Condición: New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 49,00
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Revision with unchanged content. Recently the number of applications in the Internet which use data broad casts, such as pay-per-view services, has increased greatly. In broadcast scheduling one is interested in answering user requests in such services with as little bandwidth as possible by bundling the answers appropriately. Flows over time are an important notion arising in connection with various appli cations in communication and transportation networks. One of the basic question here is how can demands in a given network be routed to their destinations as quickly as possible Economic relationships in the Internet are of great interest, e.g., when investigating robustness issues. Since they are treated as trade secrets, it is a challenge to infer them form samples of routes taken by packets in the Internet. The author Alexander Hall gives intro ductions and several novel results for these three problem areas. Some of the main results resolve the complexity of the major optimization problems encountered in the three areas. Thereby, important and in some cases long-standing open questions have been answered. From an algorithmic point of view, optimal and approximation algorithms for each of the three areas are proposed. This book is of interest to scientists in academia and industry working on research problems pertaining to communication and transportation net works. 160 pp. Englisch.…

- Tapa blanda
- Impresión bajo demanda
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 80,62
Envío por EUR 7,58Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. Print on Demand.

- Tapa blanda
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 39,24
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Hall AlexanderDr. Alexander HallReceived his PhD degree in the area of Theoretical Computer Science at the ETH Zurich and is currently a Software Engineer at Google, Switzerland.Revision with unchanged content. Recently the numb. …

- Tapa blanda
- Impresión bajo demanda
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 80,94
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 4 disponibles
Condición: New. PRINT ON DEMAND.

- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 49,00
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponible
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Revision with unchanged content. Recently the number of applications in the Internet which use data broadcasts, such as pay-per-view services, has increased greatly. In broadcast scheduling one is interested in answering user requests in such services with as little bandwidth as possible by bundling the answers appropriately. Flows over time are an important notion arising in connection with various applications in communication and transportation networks. One of the basic question here is how can demands in a given network be routed to their destinations as quickly as possible Economic relationships in the Internet are of great interest, e.g., when investigating robustness issues. Since they are treated as trade secrets, it is a challenge to infer them form samples of routes taken by packets in the Internet. The author Alexander Hall gives introductions and several novel results for these three problem areas. Some of the main results resolve the complexity of the major optimization problems encountered in the three areas. Thereby, important and in some cases long-standing open questions have been answered. From an algorithmic point of view, optimal and approximation algorithms for each of the three areas are proposed. This book is of interest to scientists in academia and industry working on research problems pertaining to communication and transportation networks.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 160 pp. Englisch.…

- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 49,00
Envío por EUR 61,28Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponible
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Revision with unchanged content. Recently the number of applications in the Internet which use data broad casts, such as pay-per-view services, has increased greatly. In broadcast scheduling one is interested in answering user requests in such services with as little bandwidth as possible by bundling the answers appropriately. Flows over time are an important notion arising in connection with various appli cations in communication and transportation networks. One of the basic question here is how can demands in a given network be routed to their destinations as quickly as possible Economic relationships in the Internet are of great interest, e.g., when investigating robustness issues. Since they are treated as trade secrets, it is a challenge to infer them form samples of routes taken by packets in the Internet. The author Alexander Hall gives intro ductions and several novel results for these three problem areas. Some of the main results resolve the complexity of the major optimization problems encountered in the three areas. Thereby, important and in some cases long-standing open questions have been answered. From an algorithmic point of view, optimal and approximation algorithms for each of the three areas are proposed. This book is of interest to scientists in academia and industry working on research problems pertaining to communication and transportation net works.…

- Tapa blanda
- Impresión bajo demanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 42,65
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. Scheduling and Flow-Related Problems in Networks | Algorithms and Complexity | Alexander Hall | Taschenbuch | 160 S. | Englisch | 2012 | AV Akademikerverlag | EAN 9783639409772 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.…