libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro

hromkovic juraj (curatore); královiç richard (curatore); nunkesser marc (curatore); widmayer peter (curatore) - stochastic algorithms: foundations and applications

Stochastic Algorithms: Foundations and Applications 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings

; ; ;




Disponibilità: Normalmente disponibile in 15 giorni


PREZZO
54,98 €
NICEPRICE
52,23 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, 18App Bonus Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Pubblicazione: 09/2007
Edizione: 2007





Trama

This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007, held in Zurich, Switzerland, in September 2007.
The 9 revised full papers and 5 invoted papers presented were carefully reviewed and selected out of 31 submissions for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations whith a special focus on investigating the power of randomization in algorithmics.




Sommario

Invited Papers.- On Computation and Communication with Small Bias.- Design Strategies for Minimal Perfect Hash Functions.- Hamming, Permutations and Automata.- Probabilistic Techniques in Algorithmic Game Theory.- Randomized Algorithms and Probabilistic Analysis in Wireless Networking.- Contributed Papers.- A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games.- Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks.- Approximate Discovery of Random Graphs.- A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis.- Digit Set Randomization in Elliptic Curve Cryptography.- Lower Bounds for Hit-and-Run Direct Search.- An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata.- Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks.- On the Support Size of Stable Strategies in Random Games.










Altre Informazioni

ISBN:

9783540748700

Condizione: Nuovo
Collana: Lecture Notes in Computer Science
Dimensioni: 235 x 155 mm
Formato: Brossura
Illustration Notes:X, 170 p.
Pagine Arabe: 170
Pagine Romane: x


Dicono di noi