Order Total (1 Item Items):
Shipping Destination:
Sezer Ergin (23 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (23)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (18)
- As New, Fine or Near Fine (5)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (2)
- Not Print on Demand (11)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
-
Condition: As New. Unread book in perfect condition.
-
-
Condition: As New. Unread book in perfect condition.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 27.68
US$ 20.17 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 33.06
US$ 20.17 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 41.84
US$ 20.17 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
US$ 48.19
US$ 20.17 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Language: English
Published by Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 102508814X ISBN 13: 9781025088143
Taschenbuch. Condition: 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.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Language: English
Published by Creative Media Partners, LLC, 2025
ISBN 10: 102508814X ISBN 13: 9781025088143
PAP. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Language: English
Published by Creative Media Partners, LLC Mai 2025, 2025
ISBN 10: 1025083814 ISBN 13: 9781025083810
Buch. Condition: Neu. Neuware.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Language: English
Published by Creative Media Partners, LLC, 2025
ISBN 10: 102508814X ISBN 13: 9781025088143
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 23.73
US$ 4.43 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPAP. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
US$ 117.75
US$ 33.62 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: Like New. Like New. book.
-
Condition: New. Print on Demand.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Language: English
Published by Creative Media Partners, LLC, 2025
ISBN 10: 1025083814 ISBN 13: 9781025083810
HRD. Condition: New. New Book. Shipped from UK. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
Condition: New. Print on Demand.
-
Mission Route Planning With Multiple Aircraft and Targets Using Parallel A* Algorithm
Language: English
Published by Creative Media Partners, LLC, 2025
ISBN 10: 1025083814 ISBN 13: 9781025083810
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
US$ 37.67
US$ 5.60 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
-
Condition: New. PRINT ON DEMAND.
-
Condition: New. Print on Demand.
-
Condition: New. Print on Demand.
-
Condition: New. PRINT ON DEMAND.
-
US$ 27.69
US$ 49.76 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. Condition: 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.
-
US$ 42.23
US$ 49.76 shipping
Ships from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: 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.
