When.com Web Search

  1. Ads

    related to: distance map calculator for runners and rugs

Search results

  1. Results From The WOW.Com Content Network
  2. Peter Riegel - Wikipedia

    en.wikipedia.org/wiki/Peter_Riegel

    Peter Riegel (January 30, 1935 – May 28, 2018) was an American research engineer who developed a mathematical formula for predicting race times for runners and other athletes given a certain performance at another distance. The formula has been widely adopted on account of its simplicity and predictive accuracy.

  3. Association of Road Racing Statisticians - Wikipedia

    en.wikipedia.org/wiki/Association_of_Road_Racing...

    The Association of Road Racing Statisticians is an independent, non-profit organization that collects, analyzes, and publishes statistics regarding road running races. The primary purpose of the ARRS is to maintain a valid list of world road records for standard race distances and to establish valid criteria for road record-keeping. [1]

  4. Pacing strategies in track and field - Wikipedia

    en.wikipedia.org/wiki/Pacing_strategies_in_track...

    These optimal strategies differ for runners in sprint events, such as the 100 meters, runners in middle-distance events, such as the 800 meters or the mile run, [3] and runners in long-distance events, such as the 5000m [4] or marathon. [5] Additionally, pacing typically differs between different styles of races.

  5. Naismith's rule - Wikipedia

    en.wikipedia.org/wiki/Naismith's_rule

    That is, 7.92 units of distance are equivalent to 1 unit of climb. For convenience an 8 to 1 rule can be used. So, for example, if a route is 20 kilometres (12 mi) with 1600 metres of climb (as is the case on leg 1 of the Bob Graham Round , Keswick to Threlkeld), the equivalent flat distance of this route is 20+(1.6×8)=32.8 kilometres (20.4 mi).

  6. Distance medley relay - Wikipedia

    en.wikipedia.org/wiki/Distance_medley_relay

    A distance medley relay is made up of a 1200-meter leg (three laps on a standard 400 meter track), a 400-meter leg (one lap), an 800-meter leg (two laps), and a 1600-meter leg (four laps) in that order. The total distance run is 4000 meters, or nearly 2.5 miles. Aside from the 400 meter segment, which is a sprint, all legs are a middle distance ...

  7. Dijkstra's algorithm - Wikipedia

    en.wikipedia.org/wiki/Dijkstra's_algorithm

    Dijkstra's algorithm (/ ˈ d aɪ k s t r ə z / DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, a road network.