Randomized Algorithms
ສ.ຫ. 1995 · Cambridge University Press
ປຶ້ມອີບຸກ
496
ໜ້າ
reportບໍ່ໄດ້ຢັ້ງຢືນການຈັດອັນດັບ ແລະ ຄຳຕິຊົມ ສຶກສາເພີ່ມເຕີມ
ກ່ຽວກັບປຶ້ມ e-book ນີ້
For many applications a randomized algorithm is either the simplest algorithm available, or the fastest, or both. This tutorial presents the basic concepts in the design and analysis of randomized algorithms. The first part of the book presents tools from probability theory and probabilistic analysis that are recurrent in algorithmic applications. Algorithmic examples are given to illustrate the use of each tool in a concrete setting. In the second part of the book, each of the seven chapters focuses on one important area of application of randomized algorithms: data structures; geometric algorithms; graph algorithms; number theory; enumeration; parallel algorithms; and on-line algorithms. A comprehensive and representative selection of the algorithms in these areas is also given. This book should prove invaluable as a reference for researchers and professional programmers, as well as for students.
ໃຫ້ຄະແນນ e-book ນີ້
ບອກພວກເຮົາວ່າທ່ານຄິດແນວໃດ.
ອ່ານຂໍ້ມູນຂ່າວສານ
ສະມາດໂຟນ ແລະ ແທັບເລັດ
ຕິດຕັ້ງ ແອັບ Google Play Books ສຳລັບ Android ແລະ iPad/iPhone. ມັນຊິ້ງຂໍ້ມູນໂດຍອັດຕະໂນມັດກັບບັນຊີຂອງທ່ານ ແລະ ອະນຸຍາດໃຫ້ທ່ານອ່ານທາງອອນລາຍ ຫຼື ແບບອອບລາຍໄດ້ ບໍ່ວ່າທ່ານຈະຢູ່ໃສ.
ແລັບທັອບ ແລະ ຄອມພິວເຕີ
ທ່ານສາມາດຟັງປຶ້ມສຽງທີ່ຊື້ໃນ Google Play ໂດຍໃຊ້ໂປຣແກຣມທ່ອງເວັບຂອງຄອມພິວເຕີຂອງທ່ານໄດ້.
eReaders ແລະອຸປະກອນອື່ນໆ
ເພື່ອອ່ານໃນອຸປະກອນ e-ink ເຊັ່ນ: Kobo eReader, ທ່ານຈຳເປັນຕ້ອງດາວໂຫຼດໄຟລ໌ ແລະ ໂອນຍ້າຍມັນໄປໃສ່ອຸປະກອນຂອງທ່ານກ່ອນ. ປະຕິບັດຕາມຄຳແນະນຳລະອຽດຂອງ ສູນຊ່ວຍເຫຼືອ ເພື່ອໂອນຍ້າຍໄຟລ໌ໄໃສ່ eReader ທີ່ຮອງຮັບ.
