Imagine a traveling salesman with a list of cities he must travel to only once while covering the shortest possible distance, before returning to his starting location. This "traveling salesman problem" has been studied for decades, and its origins can be traced back to a research paper written in 1736. Algorithms used to solve this problem are now helping plot travel itineraries through Google's new travel app, Google Trips.
.. Continue Reading Google Trips plots traveler itineraries using an algorithm from 1736Category: Holiday Destinations
Tags: Related Articles:
- MIT's "better Siri" helps you get there on time
- Dainese announces new stand-alone motorcycle airbag jacket
- New face detection algorithm registers even partially hidden faces
- Can an Earth-sized telescope show us what a black hole looks like?
- eFishery fish farm feeder dispenses feed based on fish hunger levels
- "Hitler's Acid" might lie at the heart of gas giant planets and their moons
from New Atlas http://ift.tt/2d3xNIf
No comments:
Post a Comment