Buch, Englisch, 170 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 283 g
4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings
Buch, Englisch, 170 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 283 g
Reihe: Theoretical Computer Science and General Issues
ISBN: 978-3-540-74870-0
Verlag: Springer Berlin Heidelberg
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Stochastik Stochastische Prozesse
- Mathematik | Informatik Mathematik Stochastik Elementare Stochastik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik Mathematik Stochastik Mathematische Statistik
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
- Mathematik | Informatik Mathematik Stochastik Wahrscheinlichkeitsrechnung
Weitere Infos & Material
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.
