Angebote zu "Optimum" (6 Treffer)

Kategorien

Shops

Optimum Partition Parameter of Divide-And-Conqu...
48,99 € *
ggf. zzgl. Versand

Optimum Partition Parameter of Divide-And-Conquer Algorithm ab 48.99 € als Taschenbuch: Solving Closest-Pair Problem. Aus dem Bereich: Bücher, Wissenschaft, Technik,

Anbieter: hugendubel
Stand: 29.10.2020
Zum Angebot
Route Planning Algorithms for Car Navigation
79,00 € *
ggf. zzgl. Versand

Car navigation systems provide the driver with advice on how to reach a destination. The first advice has to be determined quickly and the driver expects that the presented route is the best route to his destination. Because the road network can be very large, determining an optimum route fast is still a major challenge. This book describes algorithms that address this challenge, and also takes daily congestion on motorways into account. First, we partition a road network into regions. We present several algorithms to do so, which are tested on real-world road networks. Using this partitioning, an optimum route can be planned fast for very large road networks. Furthermore, we formulate a model for daily congestion on motorways. Using real-world data, we determine the consequences of congestion on the driver s arrival time and on the optimum route. Finally, the results of the presented algorithms are compared with those of algorithms used in commercial car navigation systems. The results show that our algorithms lead to faster route planning and routes of higher quality.

Anbieter: Dodax
Stand: 29.10.2020
Zum Angebot
Optimum Partition Parameter of Divide-And-Conqu...
49,00 € *
ggf. zzgl. Versand

Divide and Conquer is a well known algorithmic procedure for solving closest pair problems.In this procedure, the problem is partitioned into two parts until the problem is trivially solvable. It is theoretically and practically observed that sometimes partitioning the problem space into more than two parts can give better performances. In this work we proposed that dividing the problem space into (n) number of parts can give better result.We organized the book as follows,in Chapter 2, we discussed Divide-and-Conquer algorithm and Closest-Pair problem. In Chapter 3, we reviewed previous works about Divide-and- Conquer algorithm to solve Closest-Pair problem. In Chapter 4, we present detailed version of the Basic-2 algorithm and give the correspondent proof of correctness as presented by Jos e C. Pereira & Fernando G. Lobo (2010). In Chapter 5, some previous proofs are given where is proven that 2-ary system is not the best choice for all the algorithms. The results in this chapter are based on [Kayk98]. In Chapter 6, a new procedure of divide and conquer rule is presented to solve the closest pair of points problem. In Chapter 7, we discussed future work and conclude our work.

Anbieter: Dodax
Stand: 29.10.2020
Zum Angebot
Route Planning Algorithms for Car Navigation
134,00 CHF *
ggf. zzgl. Versand

Car navigation systems provide the driver with advice on how to reach a destination. The first advice has to be determined quickly and the driver expects that the presented route is the best route to his destination. Because the road network can be very large, determining an optimum route fast is still a major challenge. This book describes algorithms that address this challenge, and also takes daily congestion on motorways into account. First, we partition a road network into regions. We present several algorithms to do so, which are tested on real-world road networks. Using this partitioning, an optimum route can be planned fast for very large road networks. Furthermore, we formulate a model for daily congestion on motorways. Using real-world data, we determine the consequences of congestion on the driver's arrival time and on the optimum route. Finally, the results of the presented algorithms are compared with those of algorithms used in commercial car navigation systems. The results show that our algorithms lead to faster route planning and routes of higher quality.

Anbieter: Orell Fuessli CH
Stand: 29.10.2020
Zum Angebot
Route Planning Algorithms for Car Navigation
71,99 € *
ggf. zzgl. Versand

Car navigation systems provide the driver with advice on how to reach a destination. The first advice has to be determined quickly and the driver expects that the presented route is the best route to his destination. Because the road network can be very large, determining an optimum route fast is still a major challenge. This book describes algorithms that address this challenge, and also takes daily congestion on motorways into account. First, we partition a road network into regions. We present several algorithms to do so, which are tested on real-world road networks. Using this partitioning, an optimum route can be planned fast for very large road networks. Furthermore, we formulate a model for daily congestion on motorways. Using real-world data, we determine the consequences of congestion on the driver's arrival time and on the optimum route. Finally, the results of the presented algorithms are compared with those of algorithms used in commercial car navigation systems. The results show that our algorithms lead to faster route planning and routes of higher quality.

Anbieter: Thalia AT
Stand: 29.10.2020
Zum Angebot