Tanimoto, The Elements of Artificial Intelligence, Computer Sci. Press, 1987, pp. 139-176. |
Horowitz et al., Fundamentals of Data Structures in Pascal, Comp. Sci. Press, 1984, pp. 417-419, 452-467. |
Peterson et al., Operating System Concepts 2nd ed., Addison-Wesley Pub., 1985, pp. 217-228. |
Clocksin et al., Programming in Prolog 2nd ed., Springer-Verlag, 1984, pp. 206-209. |
Barr et al., The Handbook of Artificial Intelligence vol. I, HeurisTech Press., 1981, pp. 58-62. |
Minasi, M., "Making Searches More Efficient", AI Expert, Dec. 1988, pp. 21-24. |
Minasi, M. "Optimal Searches and a Challenge", AI Expert, Jan. 1989, pp. 21-23. |
Exercise: "Problem Set #2" and respective solution listing, for computer science course taken 1987. |
"Balanced Binary Tree (BBT) Subroutine Library", for computer science course taken 1987. |
IEEE Int. Workshop on Tools for Artificial Intelligence, Architectures, Languages and Algorithms. Oct. 23, 1989, IEEE, Los Alamitos, Calif. USA pp. 482-489; Vishv Mohan Malhotra et al: "A History-Based Scheme for Accelerating Prolog Interpretation". |
IBM Technical Disclosure Bulletin, vol. 31, No. 1, Jun. 1988, New York US pp. 415-417; "Adaptive Optimization of Recursive Search Trees". |
8th Int. Workshop on Expert Systems and Their Applications. May 30, 1989, EC2, Nanterre, France pp. 365-381; Ali Belkhiri: "Efficacite en Prolog avec backtracking intelligent et apprentissage`". |
The Fourth Conf. on Artificial Intelligence Applications, Mar. 14, 1988, IEEE Comp. Soc. Press Washington, USA pp. 312-319 Rina Dechter: "Constraint Processing Incorporating Backjumping, Learning and Cutset-Decomposition". |
B. A. Dudel, "Consistent-Labeling Problems and Their Algorithms: Expected-Complexities and Theory Based Heuristics", Artificial Intelligence (Special Issue on Search & Heuristics), vol. 21, pp. 135-178, 1983. |
R. M. Haralick & G. L. Elliott, "Increasing Tree Search Efficiency for Constraint Satisfaction Problems", Artificial Intelligence, pp. 263-313, 1980. |