product iamge

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

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the refereed proceedings of the 4th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2007. The nine revised full papers and five invited papers presented were carefully selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations with a special focus on investigating the power of randomization in algorithmics.

Author(s): Harry Buhrman (auth.), Juraj Hromkovič, Richard Královič, Marc Nunkesser, Peter Widmayer (eds.)
Series: Lecture Notes in Computer Science 4665
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2007

Language: English
Pages: 170
Tags: 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

Front Matter....Pages -
On Computation and Communication with Small Bias....Pages 1-1
Design Strategies for Minimal Perfect Hash Functions....Pages 2-17
Hamming, Permutations and Automata....Pages 18-29
Probabilistic Techniques in Algorithmic Game Theory....Pages 30-53
Randomized Algorithms and Probabilistic Analysis in Wireless Networking....Pages 54-57
A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games....Pages 58-69
Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks....Pages 70-81
Approximate Discovery of Random Graphs....Pages 82-92
A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis....Pages 93-104
Digit Set Randomization in Elliptic Curve Cryptography....Pages 105-117
Lower Bounds for Hit-and-Run Direct Search....Pages 118-129
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata....Pages 130-141
Stochastic Methods for Dynamic OVSF Code Assignment in 3G Networks....Pages 142-153
On the Support Size of Stable Strategies in Random Games....Pages 154-165
Back Matter....Pages -