| |
| * | 2008 | |
|---|---|---|
| 12 | EE | Jeffrey A. Barnett: Computational Methods for A Mathematical Theory of Evidence. Classic Works of the Dempster-Shafer Theory of Belief Functions 2008: 197-216 |
| 2005 | ||
| 11 | EE | Jeffrey A. Barnett: Dynamic Task-Level Voltage Scheduling Optimizations. IEEE Trans. Computers 54(5): 508-520 (2005) |
| 1991 | ||
| 10 | Dan Geiger, Jeffrey A. Barnett: Optimal Satisficing Tree Searches. AAAI 1991: 441-445 | |
| 9 | Jeffrey A. Barnett: Combining Opinions About the Order of Rule Execution. AAAI 1991: 477-481 | |
| 8 | EE | Jeffrey A. Barnett: Calculating Dempster-Shafer Plausibility. IEEE Trans. Pattern Anal. Mach. Intell. 13(6): 599-602 (1991) |
| 1985 | ||
| 7 | Jeffrey A. Barnett: An AIer's Lament. AI Magazine 6(2): 54-56 (1985) | |
| 1984 | ||
| 6 | Jeffrey A. Barnett: How much is Control Knowledge Worth? A Primitive Example. Artif. Intell. 22(1): 77-89 (1984) | |
| 1983 | ||
| 5 | Jeffrey A. Barnett, Don Cohen: A Wrinkle on Satisficing Search Problems. IJCAI 1983: 774-776 | |
| 4 | Jeffrey A. Barnett: Optimal Searches From AND and OR Nodes. IJCAI 1983: 786-788 | |
| 3 | Jeffrey A. Barnett, Alvin S. Cooperband: Priority is a Limited Property. Operating Systems Review 17(3): 9 (1983) | |
| 1981 | ||
| 2 | Jeffrey A. Barnett: Computational Methods for a Mathematical Theory of Evidence. IJCAI 1981: 868-875 | |
| 1979 | ||
| 1 | Jeffrey A. Barnett: Garbage Collection versus Swapping. Operating Systems Review 13(3): 12-17 (1979) | |
| 1 | Don Cohen | [5] |
| 2 | Alvin S. Cooperband | [3] |
| 3 | Dan Geiger | [10] |