Jeffrey A. Barnett

13 papers A* 5Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2008 — ch.
Computational Methods for A Mathematical Theory of Evidence.
Classic Works of the Dempster-Shafer Theory of Belief Functions
Jeffrey A. Barnett
2005 J jnl
Dynamic Task-Level Voltage Scheduling Optimizations.
IEEE Trans. Computers
Jeffrey A. Barnett
1991 J jnl
Calculating Dempster-Shafer Plausibility.
IEEE Trans. Pattern Anal. Mach. Intell.
Jeffrey A. Barnett
1991 A* conf
Combining Opinions About the Order of Rule Execution.
AAAI
Jeffrey A. Barnett
1991 A* conf
Optimal Satisficing Tree Searches.
AAAI
Dan Geiger, Jeffrey A. Barnett
1985 J jnl
An AIer's Lament.
AI Mag.
Jeffrey A. Barnett
1984 J jnl
How much is Control Knowledge Worth? A Primitive Example.
Artif. Intell.
Jeffrey A. Barnett
1983 A* conf
A Wrinkle on Satisficing Search Problems.
IJCAI
Jeffrey A. Barnett, Don Cohen
1983 A* conf
Optimal Searches From AND and OR Nodes.
IJCAI
Jeffrey A. Barnett
1983 J jnl
Priority is a Limited Property.
ACM SIGOPS Oper. Syst. Rev.
Jeffrey A. Barnett, Alvin S. Cooperband
1981 A* conf
Computational Methods for a Mathematical Theory of Evidence.
IJCAI
Jeffrey A. Barnett
1979 J jnl
Garbage Collection versus Swapping.
ACM SIGOPS Oper. Syst. Rev.
Jeffrey A. Barnett
1966 — conf
The LISP 2 programming language and system.
AFIPS Fall Joint Computing Conference
Paul W. Abrahams, Jeffrey A. Barnett, Erwin Book, Donna Firth, Stanley L. Kameny, Clark Weissman, Lowell Hawkinson, Michael I. Levin, Robert A. Saunders