From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

The LISP 2 programming language and system.

P. Abrahams, J. Barnett, E. Book, D. Firth, S. Kameny, C. Weissman, L. Hawkinson, M. Levin, и R. Saunders. AFIPS Fall Joint Computing Conference, том 29 из AFIPS Conference Proceedings, стр. 661-676. AFIPS / ACM / Spartan Books, Washington D.C., (1966)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Computational Methods for A Mathematical Theory of Evidence.J. Barnett. Classic Works of the Dempster-Shafer Theory of Belief Functions, том 219 из Studies in Fuzziness and Soft Computing, Springer, (2008)Combining Opinions About the Order of Rule Execution.J. Barnett. AAAI, стр. 477-481. AAAI Press / The MIT Press, (1991)Dynamic Task-Level Voltage Scheduling Optimizations.J. Barnett. IEEE Trans. Computers, 54 (5): 508-520 (2005)A Wrinkle on Satisficing Search Problems.J. Barnett, и D. Cohen. IJCAI, стр. 774-776. William Kaufmann, (1983)An AIer's Lament.J. Barnett. AI Mag., 6 (2): 54-56 (1985)Computational Methods for a Mathematical Theory of Evidence.J. Barnett. IJCAI, стр. 868-875. William Kaufmann, (1981)Calculating Dempster-Shafer Plausibility.J. Barnett. IEEE Trans. Pattern Anal. Mach. Intell., 13 (6): 599-602 (1991)Garbage Collection versus Swapping.J. Barnett. ACM SIGOPS Oper. Syst. Rev., 13 (3): 12-17 (1979)The LISP 2 programming language and system.P. Abrahams, J. Barnett, E. Book, D. Firth, S. Kameny, C. Weissman, L. Hawkinson, M. Levin, и R. Saunders. AFIPS Fall Joint Computing Conference, том 29 из AFIPS Conference Proceedings, стр. 661-676. AFIPS / ACM / Spartan Books, Washington D.C., (1966)Optimal Satisficing Tree Searches.D. Geiger, и J. Barnett. AAAI, стр. 441-445. AAAI Press / The MIT Press, (1991)