LIBRISTO
LIBROAMANTO
obvezno
Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun
0
Brezplačna dostava Zásilkovna nad 69.99 €
Zbirna točka GLS 4.49 Zbirna točka DPD 2.99 Kurirska služba GLS 5.49 Kurir DPD 3.49 Kurirska služba 3.49 Zbirno mesto 3.49 Zbirno mesto 3.49 Dostava preko Pošte Slovenije 3.49

Brezplačna dostava za naročila nad 69.99 € na paketomatih Pošte Slovenije.

Path Problems in Networks

Jezik AngleščinaAngleščina
Knjiga Mehka
Knjiga Path Problems in Networks John Baras
Koda Libristo: 39298738
Založba Springer International Publishing, januar 2010
The algebraic path problem is a generalization of the shortest path problem in graphs. Various insta... Celoten opis
? points 65 b
26.82
Na zalogi pri dobavitelju Odposlali bomo v 5-8 dneh

30 dni za vračilo blaga

The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be conceptually divided into two parts: A distillation of the extensive theory behind the algebraic path problem, and an exposition of a broad range of applications. First of all, the shortest path problem is presented so as to fix terminology and concepts: existence and uniqueness of solutions, robustness to parameter changes, and centralized and distributed computation algorithms. Then, these concepts are generalized to the algebraic context of semirings. Methods for creating new semirings, useful for modeling new problems, are provided. A large part of the book is then devoted to numerous applications of the algebraic path problem, ranging from mobile network routing to BGP routing to social networks. These applications show what kind of problems can be modeled as algebraic path problems; they also serve as examples on how to go about modeling new problems.This monograph will be useful to network researchers, engineers, and graduate students. It can be used either as an introduction to the topic, or as a quick reference to the theoretical facts, algorithms, and application examples. The theoretical background assumed for the reader is that of a graduate or advanced undergraduate student in computer science or engineering. Some familiarity with algebra and algorithms is helpful, but not necessary. Algebra, in particular, is used as a convenient and concise language to describe problems that are essentially combinatorial.Table of Contents: Classical Shortest Path / The Algebraic Path Problem / Properties and Computation of Solutions / Applications / Related Areas / List of Semirings and Applications

Igralka & Poliglotka
EWA KASP za
Predvajaj video
Ewa Kasp
Libristo ima največjo izbiro tujejezične literature. Zato svoje knjige kupujem tukaj.

O knjigi

Polni naslov Path Problems in Networks
Avtor John Baras
Jezik Angleščina
Vezava Knjiga - Mehka
Datum izida 2010
Število strani 80
EAN 9783031799822
ISBN 3031799828
Koda Libristo 39298738
Teža 169
Mere 191 x 235 x 5
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovanca

Prijava

Prijavite se v svoj račun. Še nimate računa Libristo? Ustvarite ga zdaj!

 
obvezno
obvezno

Še nimate računa? Izkoristite prednosti računa Libristo!

Z računom Libristo boste imeli vedno vse pod nadzorom.

Ustvarite račun Libristo
Knjižni svetovalec Libroamiko
Pozdravljeni, sem Libroamiko, vam lahko pomagam?