Stochastic Algorithms: Foundations and Applications
Hromkovič, Juraj.
Stochastic Algorithms: Foundations and Applications 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007. Proceedings / [electronic resource] : edited by Juraj Hromkovič, Richard Královič, Marc Nunkesser, Peter Widmayer. - X, 170 p. online resource. - Lecture Notes in Computer Science, 4665 0302-9743 ; . - Lecture Notes in Computer Science, 4665 .
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.
9783540748717
10.1007/978-3-540-74871-7 doi
Computer science.
Computer software.
Computational complexity.
Algorithms.
Distribution (Probability theory).
Computer Science.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Probability and Statistics in Computer Science.
Discrete Mathematics in Computer Science.
Probability Theory and Stochastic Processes.
Algorithms.
QA76.9.A43
005.1
Stochastic Algorithms: Foundations and Applications 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007. Proceedings / [electronic resource] : edited by Juraj Hromkovič, Richard Královič, Marc Nunkesser, Peter Widmayer. - X, 170 p. online resource. - Lecture Notes in Computer Science, 4665 0302-9743 ; . - Lecture Notes in Computer Science, 4665 .
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.
9783540748717
10.1007/978-3-540-74871-7 doi
Computer science.
Computer software.
Computational complexity.
Algorithms.
Distribution (Probability theory).
Computer Science.
Algorithm Analysis and Problem Complexity.
Computation by Abstract Devices.
Probability and Statistics in Computer Science.
Discrete Mathematics in Computer Science.
Probability Theory and Stochastic Processes.
Algorithms.
QA76.9.A43
005.1