Likely-Admissible & sub-symbolic heuristics

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 613-617

  Ernandes, Marco ^a   Gori, Marco ^a  

^a UNIVERSITY OF SIENA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; NEURAL NETWORKS; OPTIMAL SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

A* ALGORITHM; COMBINATORIAL EXPLOSION; LEARN+; OPTIMAL SOLUTIONS; OPTIMALITY; PROBABILISTICS; PROBLEM-SOLVING; STATISTICAL LEARNING TECHNIQUES; SUB-SYMBOLIC; UPPER BOUND;

COSTS;

EID: 85017384762     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. J. C. Culberson and J. Schaeffer, Searching with pattern databases, in Canadian Conference on AI, pp. 402-416, (1996).
2. J. C. Culberson and J. Schaeffer, Pattern databases, Computational Intelligence, 14(3), 318-334, (1998).
3. M. Ernandes, Joining symbolic and subsymbolic sources for p-Admissible non memory-based heuristics., AI∗IA Notizie, 4, (2003).
4. Ariel Felner, S. Kraus, and R. E. Korf, Kbfs: K-best-first search, Annals of Mathematics and Artificial Intelligence, 39(1-2), 19-39, (2003).
5. O. Hansson, A. Mayer, and M. Yung, Criticizing solutions to relaxed models yields powerful admissible heuristics, Information Sciences, 63(3), 165-178, (1992).
6. R. C. Holte and I. T. Herńadvolgyi, A space-Time tradeoff for memorybased heuristics, in Proceedings of AAAI-99, pp. 704-709, (1999).
7. R. E. Korf, Depth first iterative deepening: An optimal admissible search., Artificial Intelligence, 27, 97-109, (1985).
8. R. E. Korf and A. Felner, Disjoint pattern database heuristics, Artificial Intelligence, 134, 9-22, (2002).
9. R. E. Korf and L. A. Taylor, Finding optimal solutions to the twentyfour puzzle, in Proceedings of AAAI-96, pp. 1202-1207, (1996).
10. Richard E. Korf, Finding optimal solutions to rubiks cube using pattern databases., in Proceedings of AAAI-97, pp. 700-705, (1997).
11. J. Mostow and A. Prieditis, Discovering admissible heuristics by abstracting and optimizing: A transformational approach, in Proceedings of IJCAI-89, pp. 701-707, Detroit, (1989).
12. J. Pearl, Heuristics, Addison-Wesley, Reading, MA, 1984.
13. 2-1)-puzzle and related relocation problems, Journal of Symbolic Computation, 10, 111-137, (1990).
14. L. Valiant, A theory of the learnable., Communications of the ACM, 27(11), 1134-1142, (1984).