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: TextTextSeries: Lecture Notes in Computer Science ; 4665Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: X, 170 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540748717Subject(s): 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 | AlgorithmsAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online 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 eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK7809

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 on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha