Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Armand Prieditis
1990 – 1999
- 1999
[j7]Robert Davis, Armand Prieditis: Designing Optimal Sequential Experiments for a Bayesian Classifier. IEEE Trans. Pattern Anal. Mach. Intell. 21(3): 193-201 (1999)- 1998
- [j6]Armand Prieditis: Depth-First Branch-and-Bound vs. Depth-Bounded IDA*. Computational Intelligence 14(2): 188-206 (1998)
- [j5]Armand Prieditis, Evan Fletcher: Two-agent IDA*. J. Exp. Theor. Artif. Intell. 10(4): 451-485 (1998)
- 1997
- [j4]Armand Prieditis: Adding upper-bound pruning to IDA*. J. Exp. Theor. Artif. Intell. 9(1): 67-81 (1997)
- 1995
- [j3]Armand Prieditis, Robert Davis: Quantitatively Relating Abstractness to the Accuracy of Admissible Heuristics. Artif. Intell. 74(1): 165-175 (1995)
- [e1]Armand Prieditis, Stuart J. Russell (Eds.): Machine Learning, Proceedings of the Twelfth International Conference on Machine Learning, Tahoe City, California, USA, July 9-12, 1995. Morgan Kaufmann 1995, ISBN 1-55860-377-8
- 1993
- [j2]Robert Davis, Armand Prieditis: The Expected Length of a Shortest Path. Inf. Process. Lett. 46(3): 135-141 (1993)
- [j1]Armand Prieditis: Machine Discovery of Effective Admissible Heuristics. Machine Learning 12: 117-141 (1993)
- [c5]Armand Prieditis, Bhaskar Janakiraman: Generating Effective Admissible Heuristics by Abstraction and Reconstitution. AAAI 1993: 743-748
- 1991
- [c4]
1980 – 1989
- 1989
- [c3]Jack Mostow, Armand Prieditis: Discovering Admissible Search Heuristics by Abstracting and Optimizing. ML 1989: 240-240
- [c2]Jack Mostow, Armand Prieditis: Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational Approach. IJCAI 1989: 701-707
- 1987
- [c1]Armand Prieditis, Jack Mostow: PROLEARN: Towards a Prolog Interpreter that Learns. AAAI 1987: 494-498
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-13 22:40 CET by the dblp team