Efficient Algorithms for the Maximum Convex Sum Problem: Kth Maximum Convex Sum | DealShopping Deutschland
  1. Home
  2. Medien
  3. Bücher
  4. Efficient Algorithms for the Maximum Convex Sum Problem: Kth Maximum Convex Sum
  • #

Efficient Algorithms for the Maximum Convex Sum Problem: Kth Maximum Convex Sum

49.00 EUR

Teilen:

Ähnliche Produkte

Routing Algorithms for 3D Ad Hoc Networks: Efficient position-based routing algorithms with the associated pre-processing algorithms for various 3D ad hoc networks

Routing Algorithms for 3D Ad Hoc Networks: Efficient position-based routing algorithms with the associated pre-processing algorithms for various 3D ad hoc networks

58.34 EUR
Efficient and Effective Algorithm for Wireless Networks

Efficient and Effective Algorithm for Wireless Networks

35.89 EUR
An Efficient Algorithm For Shortest Path Tree In Dynamic Graph

An Efficient Algorithm For Shortest Path Tree In Dynamic Graph

35.89 EUR
Election Algorithm for AODV Routing Protocol in Mobile Adhoc Network

Election Algorithm for AODV Routing Protocol in Mobile Adhoc Network

54.90 EUR
Maximizing Energy Efficient Techniques in Wireless Sensor Networks

Maximizing Energy Efficient Techniques in Wireless Sensor Networks

68.00 EUR
sBAM in solving Traveling Salesman Problem: A Cost Efficient Algorithm sBAM in Comparison to Genetic Algorithm for Solving the Traveling Salesman Problem

sBAM in solving Traveling Salesman Problem: A Cost Efficient Algorithm sBAM in Comparison to Genetic Algorithm for Solving the Traveling Salesman Problem

49.00 EUR