Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: New.
Anbieter: GreatBookPrices, Columbia, MD, USA
Zustand: As New. Unread book in perfect condition.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 23,86
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 28,49
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 36,06
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: New.
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
EUR 41,53
Anzahl: Mehr als 20 verfügbar
In den WarenkorbZustand: As New. Unread book in perfect condition.
Sprache: Englisch
Verlag: Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 102508814X ISBN 13: 9781025088143
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Neuware - The general Mission Route Planning (MRP) Problem is the process of selecting an aircraft flight path in order to fly from a starting point through defended terrain to target(s), and return to a safe destination. MRP is a three-dimensional, multi-criteria path search. Planning of aircraft routes involves an elaborate search through numerous possibilities, which can severely task the resources of the system being used to compute the routes. Operational systems can take up to a day to arrive at a solution due to the combinatoric nature of the problem, which is not acceptable, because time is critical in aviation. Also, the information that the software is using to solve the MRP may become invalid during the computation. An effective and efficient way of solving the MRP with multiple aircraft and multiple targets is desired using parallel computing techniques. Processors find the optimal solution by exploring in parallel the MRP search space. With this distributed decomposition the time required for an optimal solution is reduced as compared to a sequential version. We have designed an effective and scalable MRP solution using a parallelized version of the A\* search algorithm. Efficient implementation and extensive testing was done using MPI on clusters of workstations and PCs.
Sprache: Englisch
Verlag: Creative Media Partners, LLC, 2025
ISBN 10: 102508814X ISBN 13: 9781025088143
Anbieter: PBShop.store US, Wood Dale, IL, USA
PAP. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Sprache: Englisch
Verlag: Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 1025083814 ISBN 13: 9781025083810
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Neuware.
Sprache: Englisch
Verlag: Creative Media Partners, LLC, 2025
ISBN 10: 102508814X ISBN 13: 9781025088143
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 20,45
Anzahl: Mehr als 20 verfügbar
In den WarenkorbPAP. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Anbieter: Mispah books, Redhill, SURRE, Vereinigtes Königreich
EUR 101,48
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: Like New. Like New. book.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 26,54
Anzahl: 4 verfügbar
In den WarenkorbZustand: New. Print on Demand.
Sprache: Englisch
Verlag: Creative Media Partners, LLC, 2025
ISBN 10: 1025083814 ISBN 13: 9781025083810
Anbieter: PBShop.store US, Wood Dale, IL, USA
HRD. Zustand: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. Print on Demand.
Sprache: Englisch
Verlag: Creative Media Partners, LLC, 2025
ISBN 10: 1025083814 ISBN 13: 9781025083810
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
EUR 32,47
Anzahl: Mehr als 20 verfügbar
In den WarenkorbHRD. Zustand: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND.
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 38,05
Anzahl: 4 verfügbar
In den WarenkorbZustand: New. Print on Demand.
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. Print on Demand.
Anbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Zustand: New. PRINT ON DEMAND.
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
EUR 23,87
Anzahl: 1 verfügbar
In den WarenkorbPaperback. Zustand: new. Paperback. The general Mission Route Planning (MRP) Problem is the process of selecting an aircraft flight path in order to fly from a starting point through defended terrain to target(s), and return to a safe destination. MRP is a three-dimensional, multi-criteria path search. Planning of aircraft routes involves an elaborate search through numerous possibilities, which can severely task the resources of the system being used to compute the routes. Operational systems can take up to a day to arrive at a solution due to the combinatoric nature of the problem, which is not acceptable, because time is critical in aviation. Also, the information that the software is using to solve the MRP may become invalid during the computation. An effective and efficient way of solving the MRP with multiple aircraft and multiple targets is desired using parallel computing techniques. Processors find the optimal solution by exploring in parallel the MRP search space. With this distributed decomposition the time required for an optimal solution is reduced as compared to a sequential version. We have designed an effective and scalable MRP solution using a parallelized version of the A* search algorithm. Efficient implementation and extensive testing was done using MPI on clusters of workstations and PCs.This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Anbieter: CitiRetail, Stevenage, Vereinigtes Königreich
EUR 36,40
Anzahl: 1 verfügbar
In den WarenkorbHardcover. Zustand: new. Hardcover. The general Mission Route Planning (MRP) Problem is the process of selecting an aircraft flight path in order to fly from a starting point through defended terrain to target(s), and return to a safe destination. MRP is a three-dimensional, multi-criteria path search. Planning of aircraft routes involves an elaborate search through numerous possibilities, which can severely task the resources of the system being used to compute the routes. Operational systems can take up to a day to arrive at a solution due to the combinatoric nature of the problem, which is not acceptable, because time is critical in aviation. Also, the information that the software is using to solve the MRP may become invalid during the computation. An effective and efficient way of solving the MRP with multiple aircraft and multiple targets is desired using parallel computing techniques. Processors find the optimal solution by exploring in parallel the MRP search space. With this distributed decomposition the time required for an optimal solution is reduced as compared to a sequential version. We have designed an effective and scalable MRP solution using a parallelized version of the A* search algorithm. Efficient implementation and extensive testing was done using MPI on clusters of workstations and PCs.This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.