enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Naismith's rule - Wikipedia

    en.wikipedia.org/wiki/Naismith's_rule

    Pace [6] in minutes per kilometre or mile vs. slope angle resulting from Naismith's rule [7] for basal speeds of 5 and 4 km / h. [n 1]The original Naismith's rule from 1892 says that one should allow one hour per three miles on the map and an additional hour per 2000 feet of ascent.

  3. Earth mover's distance - Wikipedia

    en.wikipedia.org/wiki/Earth_mover's_distance

    It is the solution of the optimal transport problem, which in turn is also known as the Monge-Kantorovich problem, or sometimes the Hitchcock–Koopmans transportation problem; [3] when the measures are uniform over a set of discrete elements, the same optimization problem is known as minimum weight bipartite matching.

  4. Log-distance path loss model - Wikipedia

    en.wikipedia.org/wiki/Log-distance_path_loss_model

    The log-distance path loss model is a radio propagation model that predicts the path loss a signal encounters inside a building or densely populated areas over long distance. While the log-distance model is suitable for longer distances, the short-distance path loss model is often used for indoor environments or very short outdoor distances.

  5. Space travel under constant acceleration - Wikipedia

    en.wikipedia.org/wiki/Space_travel_under...

    For the middle of the journey the ship's speed will be roughly the speed of light, and it will slow down again to zero over a year at the end of the journey. As a rule of thumb, for a constant acceleration at 1 g (Earth gravity), the journey time, as measured on Earth, will be the distance in light years to the destination, plus 1 year. This ...

  6. Maze-solving algorithm - Wikipedia

    en.wikipedia.org/wiki/Maze-solving_algorithm

    Robot in a wooden maze. A maze-solving algorithm is an automated method for solving a maze.The random mouse, wall follower, Pledge, and Trémaux's algorithms are designed to be used inside the maze by a traveler with no prior knowledge of the maze, whereas the dead-end filling and shortest path algorithms are designed to be used by a person or computer program that can see the whole maze at once.

  7. Transportation theory (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Transportation_theory...

    In mathematics and economics, transportation theory or transport theory is a name given to the study of optimal transportation and allocation of resources. The problem was formalized by the French mathematician Gaspard Monge in 1781.

  8. Geographical distance - Wikipedia

    en.wikipedia.org/wiki/Geographical_distance

    Geographical distance or geodetic distance is the distance measured along the surface of the Earth, or the shortest arch length. The formulae in this article calculate distances between points which are defined by geographical coordinates in terms of latitude and longitude. This distance is an element in solving the second (inverse) geodetic ...

  9. Route assignment - Wikipedia

    en.wikipedia.org/wiki/Route_assignment

    Public transport has long been considered in the context of route assignment [3] and many studies have been conducted on transit route choice. Among other factors, transit users attempt to minimize total travel time, time or distance walking, and number of transfers. [4]