Dynamic Potential Search: A New Bounded Suboptimal Search Algorithm - Daniel Gilon
-20% with code BOOKS
Shipping in 15-21 days
30-day return policy
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 ... Full description
You May Also Like
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-20% with code BOOKS
In stock at our supplier
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-20% with code BOOKS
In stock at our supplier
TOP
AI Engineering: Building Applications with Foundation Models
-20% with code BOOKS
In stock at our supplier
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-20% with code BOOKS
In stock at our supplier
TOP
The Art of Game Design: A Book of Lenses
-20% with code BOOKS
In stock at our supplier
TOP
How To Think About AI: A Guide For The Perplexed
-20% with code BOOKS
In stock at our supplier
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-20% with code BOOKS
In stock at our supplier
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-20% with code BOOKS
In stock at our supplier
TOP
HBR Guide to Generative AI for Managers
-20% with code BOOKS
In stock at our supplier
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-20% with code BOOKS
In stock at our supplier
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-20% with code BOOKS
In stock at our supplier
TOP
How Linux Works: What Every Superuser Should Know
-20% with code BOOKS
In stock at our supplier
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-20% with code BOOKS
In stock at our supplier
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-20% with code BOOKS
In stock at our supplier
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-20% with code BOOKS
In stock at our supplier
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-20% with code BOOKS
In stock at our supplier
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-20% with code BOOKS
In stock at our supplier
TOP
C Programming Language
Brian W. Kernighan, Brian Kernighan, Dennis Ritchie
-20% with code BOOKS
In stock at our supplier
TOP
Mathematics for Machine Learning
Cheng Soon Ong, A. Aldo Faisal, Marc Peter Deisenroth
-20% with code BOOKS
In stock at our supplier
Description
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.
More Information
| Author | Daniel Gilon |
|---|---|
| Publisher | LAP LAMBERT Academic Publishing |
| Release year | 2018 |
| Cover type | Softcover |
| EAN | 9786137338070 |