Iterative-deepening-A: an optimal admissible tree search

Efficient Branch-and-Bound Algorithms on a Two-Level Memory System

IEEE Transactions on Software Engineering

Building Theorem Provers

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction

A New Approach to Iterative Deepening Multiobjective A*

AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence

Efficient joint detection considering complexity of contours

PRICAI'00 Proceedings of the 6th Pacific Rim international conference on Artificial intelligence

Systematic nonlinear planning

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 2

Best-first heuristic search for multicore machines

Journal of Artificial Intelligence Research

Compositional abstractions for search factories

MOZ'04 Proceedings of the Second international conference on Multiparadigm Programming in Mozart/Oz

Abstraction-Guided model checking using symbolic IDA* and heuristic synthesis

FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems

Intelligent transportation systems-Enabling technologies

Mathematical and Computer Modelling: An International Journal

Bounded suboptimal search: a direct approach using inadmissible estimates

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One

Iterative-Deepening search with on-line tree size prediction

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization

A comparison of multiobjective depth-first algorithms

Journal of Intelligent Manufacturing

Heuristic search when time matters

Journal of Artificial Intelligence Research

Iterative-deepening search with on-line tree size prediction

Annals of Mathematics and Artificial Intelligence