Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
4. Randomized Algorithms
verfasst von : Cesare Alippi
Erschienen in: Intelligence for Embedded Systems
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
Every time we cannot solve a complex problem, either because it is too complex or computationally hard, we try to explore it on a number of instances and expect that, asymptotically with the number of samples, something can be said. This chapter introduces a key mechanism every engineer/computer scientist should be aware of, that of randomization. After having introduced the main results coming from the theory of randomization and those granting convergence of sampled quantities to the exact ones, we will present some general methods based on randomized algorithms for solving a large class of performance assessment problems. Results, independent of the dimension of the sampling space and the particular probability density function associated with sample drawing, hold in probability at arbitrary accuracy and confidence levels, function of the envisaged number of samples.