Design and Analysis of Randomized Algorithms Introduction to Design Paradigms /
Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of ye...
| Κύριος συγγραφέας: | HromkoviČ, Juraj (Συγγραφέας) |
|---|---|
| Συγγραφή απο Οργανισμό/Αρχή: | SpringerLink (Online service) |
| Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
| Γλώσσα: | English |
| Έκδοση: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2005.
|
| Σειρά: | Texts in Theoretical Computer Science An EATCS Series,
|
| Θέματα: | |
| Διαθέσιμο Online: | Full Text via HEAL-Link |
Παρόμοια τεκμήρια
-
Algorithms in Bioinformatics 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings /
Έκδοση: (2008) -
Algorithm Theory - SWAT 2010 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings /
Έκδοση: (2010) -
Algorithms and Computation 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003. Proceedings /
Έκδοση: (2003) -
Algorithms in Bioinformatics 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005. Proceedings /
Έκδοση: (2005) -
Multiobjective Optimization Interactive and Evolutionary Approaches /
Έκδοση: (2008)