An elementary solution to the mountain climbers' problem
✍ Scribed by V. J. López
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 259 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0001-9054
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Consider a simple polygon P containing disjoint convex polygons each of which shares an edge with P . The Zookeeper's Problem then asks for the shortest route in P that visits all convex polygons without entering their interiors. Existing algorithms that solve this problem run in time super-linear i
An approximate and practical solution is proposed for the Behrens-Fisher problem. This solution is compared to the solutions considered by MEHTA and SRINIVASAN (1970) and WELCH'S (1937) approximate t-test in terms of the stability of the size and magnitude of the power. It is shown that the stabilit