Cargando…

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

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Hromkovič, Juraj (Editor ), Královiç, Richard (Editor ), Nunkesser, Marc (Editor ), Widmayer, Peter (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Theoretical Computer Science and General Issues, 4665
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-74871-7
003 DE-He213
005 20230405224005.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540748717  |9 978-3-540-74871-7 
024 7 |a 10.1007/978-3-540-74871-7  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 518.1  |2 23 
245 1 0 |a Stochastic Algorithms: Foundations and Applications  |h [electronic resource] :  |b 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings /  |c edited by Juraj Hromkovič, Richard Královiç, Marc Nunkesser, Peter Widmayer. 
250 |a 1st ed. 2007. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2007. 
300 |a X, 170 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 4665 
505 0 |a 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. 
650 0 |a Algorithms. 
650 0 |a Computer science. 
650 0 |a Computer science-Mathematics. 
650 0 |a Mathematical statistics. 
650 0 |a Discrete mathematics. 
650 0 |a Probabilities. 
650 1 4 |a Algorithms. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Probability and Statistics in Computer Science. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Probability Theory. 
700 1 |a Hromkovič, Juraj.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Královiç, Richard.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Nunkesser, Marc.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Widmayer, Peter.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540843719 
776 0 8 |i Printed edition:  |z 9783540748700 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 4665 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-74871-7  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)