Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
J.M. Norman
Information about the author J.M. Norman will soon be added to the site.
Found
11 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Dynamic programming in cricket: optimizing batting order for a sticky wicket
2007
In cricket, a rain-affected pitch can make batting more difficult than normal. Several...
Dynamic programming in cricket: choosing a night watchman
2003
In cricket, when a batsman is dismissed towards the end of a day's play, he is often...
Community operational research issues and public art practice: The art director system
2000
The key issues of community operational research, outlined in a paper by Ritchie, have...
To run or not?: Some dynamic programming models in cricket
1999
In cricket, particularly near the end of an innings, batsmen of different abilities...
When to rush a ‘behind’ in Australian rules football: A dynamic programming approach
1998
In Australian rules football, points are scored when the ball passes over the goal...
Dynamic programming in sport: A survey of applications
1995
This paper surveys applications of dynamic programming to decision problems faced by...
Speed, gradient and workrate in uphill running
1995
A series of treadmill experiments is described concerned with a runner’s speed,...
Strategy in fell running: An analysis of the Bob Graham Round
1994
The ‘Bob Graham Round’ is an arduous route in the English Lake District...
Running uphill: An experimental result and its applications
1994
An experimentally derived formula has implications for (i) the measurement of a...
Sequential decision making: Some non-technical applications of dynamic programming
1991
The paper presents an elementary introduction to dynamic programming and describes...
Optimal, near-optimal and rule-of-thumb claiming rules for a protected bonus vehicle insurance policy
1989
Most motorists involved in an accident will claim from their insurance company only if...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers