9786137338070 - dynamic potential search: a new bounded suboptimal search algorithm de gilon, daniel (6 resultados)
- Tapa blanda
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 64,74
Envío por EUR 11,76Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: Brand New. 56 pages. 8.66x5.91x0.13 inches. In Stock.
- Tapa blanda
Librería: preigu, Osnabrück, Alemaniapreigu
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 33,25
Envío por EUR 70,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 5 disponibles
Taschenbuch. Condición: Neu. Dynamic Potential Search | A New Bounded Suboptimal Search Algorithm | Daniel Gilon | Taschenbuch | 56 S. | Englisch | 2018 | LAP LAMBERT Academic Publishing | EAN 9786137338070 | Verantwortliche Person für die EU: BoD - Books on Demand, In de Tarpen 42, 22848 Norderstedt, info[at]bod[dot]de | Anbiet…er: preigu.
- Tapa blanda
- Impresión bajo demanda
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, AlemaniaBuchWeltWeit Ludwig Meier e.K.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 35,90
Envío por EUR 23,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 2 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 56 pp. Englisch.
- Tapa blanda
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 31,27
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Gilon DanielDaniel Gilon holds a M.Sc degree in Information System Engineering from the Ben-Gurion University. His research interests are Algorithm Development for combinatoric problems and Games, espec…ially when looking for a soluti.
- Tapa blanda
- Impresión bajo demanda
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemaniabuchversandmimpf2000
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 35,90
Envío por EUR 60,00Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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 bou…nd. 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.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 56 pp. Englisch.
- Tapa blanda
- Impresión bajo demanda
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 37,20
Envío por EUR 60,51Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 boun…d. 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.
