Central Library

Normal view MARC view ISBD view

Stochastic Algorithms: Foundations and Applications [electronic resource] : 4th International Symposium, SAGA 2007, Zurich, Switzerland, September 13-14, 2007, Proceedings / edited by Juraj Hromkovič, Richard Královiç, Marc Nunkesser, Peter Widmayer.

Contributor(s): Hromkovič, Juraj [editor.] | Královiç, Richard [editor.] | Nunkesser, Marc [editor.] | Widmayer, Peter [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Theoretical Computer Science and General Issues: 4665Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007Edition: 1st ed. 2007.Description: X, 170 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540748717.Subject(s): Algorithms | Computer science | Computer science -- Mathematics | Mathematical statistics | Discrete mathematics | Probabilities | Algorithms | Theory of Computation | Probability and Statistics in Computer Science | Discrete Mathematics in Computer Science | Probability TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online
Contents:
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.
In: Springer Nature eBook
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.