Jeffrey A. Barnett

According to our database1, Jeffrey A. Barnett authored at least 13 papers between 1966 and 2008.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
Computational Methods for A Mathematical Theory of Evidence.
Proceedings of the Classic Works of the Dempster-Shafer Theory of Belief Functions, 2008

2005
Dynamic Task-Level Voltage Scheduling Optimizations.
IEEE Trans. Computers, 2005

1991
Calculating Dempster-Shafer Plausibility.
IEEE Trans. Pattern Anal. Mach. Intell., 1991

Optimal Satisficing Tree Searches.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

Combining Opinions About the Order of Rule Execution.
Proceedings of the 9th National Conference on Artificial Intelligence, 1991

1985
An AIer's Lament.
AI Mag., 1985

1984
How much is Control Knowledge Worth? A Primitive Example.
Artif. Intell., 1984

1983
Priority is a Limited Property.
ACM SIGOPS Oper. Syst. Rev., 1983

A Wrinkle on Satisficing Search Problems.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983

Optimal Searches From AND and OR Nodes.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983

1981
Computational Methods for a Mathematical Theory of Evidence.
Proceedings of the 7th International Joint Conference on Artificial Intelligence, 1981

1979
Garbage Collection versus Swapping.
ACM SIGOPS Oper. Syst. Rev., 1979

1966
The LISP 2 programming language and system.
Proceedings of the American Federation of Information Processing Societies: Proceedings of the AFIPS '66 Fall Joint Computer Conference, 1966


  Loading...