|
Search the dblp DataBase
Armand Prieditis:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jack Mostow, Armand Prieditis
Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational Approach. [Citation Graph (1, 0)][DBLP] IJCAI, 1989, pp:701-707 [Conf]
- Armand Prieditis
Machine Discovery of Effective Admissible Heuristics. [Citation Graph (1, 0)][DBLP] Machine Learning, 1993, v:12, n:, pp:117-141 [Journal]
- Armand Prieditis, Bhaskar Janakiraman
Generating Effective Admissible Heuristics by Abstraction and Reconstitution. [Citation Graph (0, 0)][DBLP] AAAI, 1993, pp:743-748 [Conf]
- Armand Prieditis, Jack Mostow
PROLEARN: Towards a Prolog Interpreter that Learns. [Citation Graph (0, 0)][DBLP] AAAI, 1987, pp:494-498 [Conf]
- Jack Mostow, Armand Prieditis
Discovering Admissible Search Heuristics by Abstracting and Optimizing. [Citation Graph (0, 0)][DBLP] ML, 1989, pp:240-240 [Conf]
- Armand Prieditis
Machine Discovery of Effective Admissible Heuristics. [Citation Graph (0, 0)][DBLP] IJCAI, 1991, pp:720-725 [Conf]
- Armand Prieditis, Robert Davis
Quantitatively Relating Abstractness to the Accuracy of Admissible Heuristics. [Citation Graph (0, 0)][DBLP] Artif. Intell., 1995, v:74, n:1, pp:165-175 [Journal]
- Armand Prieditis
Depth-First Branch-and-Bound vs. Depth-Bounded IDA*. [Citation Graph (0, 0)][DBLP] Computational Intelligence, 1998, v:14, n:, pp:188-206 [Journal]
- Robert Davis, Armand Prieditis
The Expected Length of a Shortest Path. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1993, v:46, n:3, pp:135-141 [Journal]
- Armand Prieditis
Adding upper-bound pruning to IDA*. [Citation Graph (0, 0)][DBLP] J. Exp. Theor. Artif. Intell., 1997, v:9, n:1, pp:67-81 [Journal]
- Armand Prieditis, Evan Fletcher
Two-agent IDA*. [Citation Graph (0, 0)][DBLP] J. Exp. Theor. Artif. Intell., 1998, v:10, n:4, pp:451-485 [Journal]
- Robert Davis, Armand Prieditis
Designing Optimal Sequential Experiments for a Bayesian Classifier. [Citation Graph (0, 0)][DBLP] IEEE Trans. Pattern Anal. Mach. Intell., 1999, v:21, n:3, pp:193-201 [Journal]
Search in 0.017secs, Finished in 0.017secs
|