| Heuristic search as evidential reasoning O Hansson, A Mayer arXiv preprint arXiv:1304.1509, 1989 | 92 | 1989 |
| Criticizing solutions to relaxed models yields powerful admissible heuristics O Hansson, A Mayer, M Yung Information Sciences 63 (3), 207-227, 1992 | 80 | 1992 |
| Probabilistic heuristic estimates O Hansson, A Mayer Annals of Mathematics and Artificial Intelligence 2 (1), 209-220, 1990 | 44 | 1990 |
| Generalized secret sharing and group-key distribution using short keys A Mayer, M Yung Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No …, 1997 | 30 | 1997 |
| The optimality of satisficing solutions O Hansson, A Mayer arXiv preprint arXiv:1304.2356, 1988 | 29 | 1988 |
| Decision theoretic planning in bps O Hansson, A Mayer, S Russell Proceedings of the AAAI Symposium on Planning, 1990 | 20 | 1990 |
| A new result on the complexity of heuristic estimates for the A★ algorithm O Hansson, A Mayer, M Valtorta Artificial Intelligence 55 (1), 129-143, 1992 | 17 | 1992 |
| Decision-theoretic control of search in BPS O Hansson, A Mayer Proceedings of the AAAI Symposium on AI and Limited Rationality, 1989 | 14 | 1989 |
| Rational search AE Mayer University of California, Berkeley, 1994 | 10 | 1994 |
| DTS: A decision-theoretic scheduler for space telescope applications O Hansson, A Mayer Intelligent scheduling, 371-388, 1994 | 10 | 1994 |
| Decision-theoretic control of artificial intelligence scheduling systems O Hansson, A Mayer Tech. Rept., 1991 | 9 | 1991 |
| Adaptive methods for netlist partitioning L Su 1997 Proceedings of IEEE International Conference on Computer Aided Design …, 1997 | 7 | 1997 |
| Toward the modeling, evaluation and optimization of search algorithms O Hansson, G Holt, A Mayer Operations Research and Artificial Intelligence: The Integration of Problem …, 1990 | 5 | 1990 |
| The comparison and optimization of search algorithm performance O Hansson, G Holt, A Mayer Unpublished manuscript, Columbia University Computer Science Department, 1986 | 5 | 1986 |
| Generating Admissible Heuristics by Criticizing Solutions to Relaxed Models O Hansson, AE Mayer, M Yung | 4 | 1985 |
| Decision-Theoretic Control of Constraint-Satisfaction and Scheduling O Hansson, A Mayer Intelligent Scheduling Systems, 63-78, 1995 | 1 | 1995 |
| DTS: Building custom, intelligent schedulers O Hansson, A Mayer JPL, Third International Symposium on Artificial Intelligence, Robotics, and …, 1994 | 1 | 1994 |
| Experiments with a decision-theoretic scheduler O Hansson, G Holt, A Mayer Proceedings of the AAAI Spring Symposium on Practical Approaches to Planning …, 1992 | 1 | 1992 |
| A New Result on the Complexity of Heuristic Estimates for the A* Algorithm O Hansson, A Mayer, M Valtorta arXiv preprint arXiv:1803.06422, 2018 | | 2018 |
| Methodologies and Tools for Complex Software Systems in Electronic Design W Buntine, A Mayer, L Su | | 1997 |
