Dynamic Potential Search: A New Bounded Suboptimal Search Algorithm - Daniel Gilon
-40% ar kodu BOOKS
Piegāde 15-21 darba dienu laikā
30 dienu atgriešanas politika
Potential Search (PS) is an algorithm that is designed to solve bounded cost search problems. In bounded cost search we are given a fixed cost-bound and the task is to find a solution (if one exists) with a cost lower than the given bound. A bounded suboptimal search problem is similar to bounded suboptimal search in the manner that it also has an upper bound on the desired solution, but here the bound is g ... Pilns apraksts
Jums varētu patikt arī
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The 21st Century Brain: Cutting edge neuroscience to help us navigate the future
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
AI Engineering: Building Applications with Foundation Models
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How To Think About AI: A Guide For The Perplexed
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How to Talk to AI: (And How Not To)
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Why Machines Learn: The Elegant Math Behind Modern AI
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Art of Game Design: A Book of Lenses
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How Linux Works: What Every Superuser Should Know
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hands-On Large Language Models: Language Understanding and Generation
Maarten Grootendorst, Jay Alammar
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Slanted 47 Digital Tools: Slanted Magazine
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-40% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Deep Learning: Foundations and Concepts
Christopher M. Bishop, Hugh Bishop
-40% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
Potential Search (PS) is an algorithm that is designed to solve bounded cost search problems. In bounded cost search we are given a fixed cost-bound and the task is to find a solution (if one exists) with a cost lower than the given bound. A bounded suboptimal search problem is similar to bounded suboptimal search in the manner that it also has an upper bound on the desired solution, but here the bound is given relative to the optimal solution and is not fixed, hence bounded suboptimal. we give a general rule on how to migrate algorithms that were designed to solve bounded cost search problems into ones that can solve bounded suboptimal search problems and vice versa. We show that this can be done for most of the known algorithms and thus improve our understanding of their relation and difference. In this book, we modify PS to work within the framework of bounded suboptimal search and introduce Dynamic Potential Search (DPS). DPS uses the idea of PS but modifies the cost-bound to be the product of the minimal f-value in OPEN and the required suboptimal bound.
Vairāk informācijas
| Autors | Daniel Gilon |
|---|---|
| Izdevējs | LAP LAMBERT Academic Publishing |
| Izlaides gads | 2018 |
| Vāka tips | Mīkstais vāks |
| EAN | 9786137338070 |