English
- استرجاع مجاني وسهل
- أفضل العروض
المواصفات
| الناشر | Scitus Academics LLC |
| رقم الكتاب المعياري الدولي 13 | 9781681172002 |
| رقم الكتاب المعياري الدولي 10 | 1681172003 |
| الكاتب | Brygida Cullen |
| تنسيق الكتاب | Hardcover |
| اللغة | English |
| وصف الكتاب | A dynamic programming (DP) is an algorithmic technique which is usually based on a recurrent formula and one (or some) starting states. A subsolution of the problem is constructed from previously found ones. Dynamic programming solutions have a polynomial complexity which assures a much faster running time than other techniques like backtracking, brute-force etc. Dynamic programming is both a mathematical optimization method and a computer programming method. In both contexts it refers to simplifying a complicated problem by breaking it down into simpler sub-problems in a recursive manner. While some decision problems cannot be taken apart this way, decisions that span several points in time do often break apart recursively. Bayesian inference is a method of statistical inference in which Bayes' theorem is used to update the probability for a hypothesis as more evidence or information becomes available. Dynamic programming algorithms are applied for optimization. A dynamic programming algorithm will inspect the previously solved sub-problems and will combine their solutions to give the best solution for the given problem. The alternatives are many, such as using a greedy algorithm, which picks the locally optimal choice at each branch in the road. The locally optimal choice may be a poor choice for the overall solution. While a greedy algorithm does not * an optimal solution, it is often faster to calculate. Fortunately, some greedy algorithms are proven to lead to the optimal solution. Dynamic programming and Bayesian inference have been both intensively and extensively advanced in the course of recent years. As a consequence of these developments, interest in dynamic programming and Bayesian inference and their applications has greatly increased at all mathematical levels. This book, Dynamic programming and Bayesian inference, Concepts and Applications, is intended to provide some applications of Bayesian optimization and dynamic programming. This book presents a wide-ranging and demanding dealing of dynamic programming. |
| تاريخ النشر | 2016-04-01 |
| عدد الصفحات | 304 pages |
Dynamic Programming and Bayesian Inference, Concep
تمت الإضافة لعربة التسوق
مجموع السلة 
0.00
