Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 19,32
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 20,81
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 32,55
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPrices, Columbia, MD, U.S.A.
EUR 33,92
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 23,80
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 28,34
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 35,87
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: GreatBookPricesUK, Woodford Green, Regno Unito
EUR 41,43
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
Lingua: Inglese
Editore: Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 102508814X ISBN 13: 9781025088143
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 30,24
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Lingua: Inglese
Editore: Creative Media Partners, LLC, 2025
ISBN 10: 102508814X ISBN 13: 9781025088143
Da: PBShop.store US, Wood Dale, IL, U.S.A.
EUR 21,67
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Lingua: Inglese
Editore: Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 1025083814 ISBN 13: 9781025083810
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 45,80
Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware.
Lingua: Inglese
Editore: Creative Media Partners, LLC, 2025
ISBN 10: 102508814X ISBN 13: 9781025088143
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 20,40
Quantità: Più di 20 disponibili
Aggiungi al carrelloPAP. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 101,24
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
Da: Majestic Books, Hounslow, Regno Unito
EUR 26,52
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Lingua: Inglese
Editore: Creative Media Partners, LLC, 2025
ISBN 10: 1025083814 ISBN 13: 9781025083810
Da: PBShop.store US, Wood Dale, IL, U.S.A.
EUR 34,90
Quantità: Più di 20 disponibili
Aggiungi al carrelloHRD. Condizione: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Print on Demand.
Lingua: Inglese
Editore: Creative Media Partners, LLC, 2025
ISBN 10: 1025083814 ISBN 13: 9781025083810
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
EUR 32,39
Quantità: Più di 20 disponibili
Aggiungi al carrelloHRD. Condizione: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 27,28
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.
Da: Majestic Books, Hounslow, Regno Unito
EUR 38,03
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand.
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. Print on Demand.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 38,44
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND.
Da: CitiRetail, Stevenage, Regno Unito
EUR 23,81
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: 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.
Da: CitiRetail, Stevenage, Regno Unito
EUR 36,31
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.