Gerald R. Garside

According to our database, Gerald R. Garside authored at least 8 papers between 1991 and 1999.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of six.

1999

The efficient estimation of missing information in causal inverted multiway trees.

Gerald R. Garside, Paul C. Rhodes, Dawn E. Holmes

Knowl. Based Syst., 1999

Efficient computation of marginal probabilities in multivalued causal inverted multiway trees given incomplete information.

Dawn E. Holmes, Paul C. Rhodes, Gerald R. Garside

Int. J. Intell. Syst., 1999

1998

Computing marginal probabilities in causal inverted binary trees given incomplete information.

Paul C. Rhodes, Gerald R. Garside

Knowl. Based Syst., 1998

1996

Computing marginal probabilities in causal multiway trees given incomplete information.

Gerald R. Garside, Paul C. Rhodes

Knowl. Based Syst., 1996

1995

Use of maximum entropy method as a methodology for probabilistic reasoning.

Paul C. Rhodes, Gerald R. Garside

Knowl. Based Syst., 1995

Using Maximum Entropy to Compute Marginal Probabilities in a Causal Binary Tree Need not Take Exponential Time.

Paul C. Rhodes, Gerald R. Garside

Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1995

1991

Reappraisal of the use of conditional probability in early expert systems.

Paul C. Rhodes, Gerald R. Garside

Knowl. Based Syst., 1991

Using Maximum Entropy to Identify Unsafe Assumptions in Probabilistic Expert Systems.

Paul C. Rhodes, Gerald R. Garside

Proceedings of the Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1991