A formal analysis of why heuristic functions work

Artificial Intelligence

Volumn 164, Issue 1-2, 2005, Pages 1-22

  Oommen, B John ^a   Rueda, Luis G ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; DATABASE SYSTEMS; FUNCTIONS; HEURISTIC METHODS; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING;

CLOSED-FORM EXPRESSION; EQUI-WIDTH; HEURISTIC FUNCTIONS WORK; HISTOGRAM;

COMPUTER SCIENCE;

EID: 16244375895     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2002.02.001     Document Type: Article

References (28)

1. E. Aarts, and J. Korst Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing 1989 Wiley New York
2. S. Christodoulakis, Estimating selectivities in data bases, Technical Report CSRG-136, Computer Science Department, University of Toronto, 1981
3. E. Deeba, and A. Gunawardena Interactive Linear Algebra with MAPLE V 1997 Springer Berlin
4. R. Duda, P. Hart, and D. Stork Pattern Classification second ed. 2000 Wiley New York
5. K. Fukunaga Introduction to Statistical Pattern Recognition 1990 Academic Press New York
6. M. Garey, and D. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman New York
7. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Dordrecht
8. Y. Ioannidis, and S. Christodoulakis On the propagation of errors in the size of join results Proceedings of the ACM-SIGMOD Conference 1991 268 277
9. R.P. Kooi, The optimization of queries in relational databases, PhD thesis, Case Western Reserve University, 1980
10. D. Kreher, and D. Stinson Combinatorial Algorithms: Generation, Enumeration, and Search 1998 CRC Press Boca Raton, FL
11. D. Levy How Computers Play Chess 1991 Computer Science Press New York
12. M.V. Mannino, P. Chu, and T. Sager Statistical profile estimation in database systems ACM Computing Surveys, vol. 20 1988 192 221
13. M. Michell An Introduction to Genetic Algorithms 1998 MIT Press Cambridge, MA
14. M. Muralikrishna, and D. Dewitt Equi-depth histograms for estimating selectivity factors for multi-dimensional queries Proceedings of ACM-SIGMOD Conference 1988 28 36
15. Kumpati Narendra, and M.A.L. Thathachar Learning Automata: An Introduction 1989 Prentice Hall Englewood Cliffs, NJ
16. N. Nilsson Artificial Intelligence: A New Synthesis 1998 Morgan Kaufmann San Mateo, CA
17. B.J. Oommen, and L. Rueda The efficiency of modern-day histogram-like techniques for query optimization Comput. J. 45 5 2002 494 510
18. B.J. Oommen, and M. Thiyagarajah The Rectangular Attribute Cardinality Map: A New Histogram-like Technique for Query Optimization Proceedings of the International Database Engineering and Applications Symposium, IDEAS'99, Montreal, Canada 1999 3 15
19. B.J. Oommen, and M. Thiyagarajah On the use of the trapezoidal attribute cardinality map for query result size estimation Proceedings of the 2000 International Database Engineering and Applications Symposium, Yokohama, Japan 2000 236 242
20. B.J. Oommen, and T. De St. Croix Graph partitioning using learning automata IEEE Trans. Comput. 45 2 1995 195 208
21. F. Peracchi Econometrics 2001 Wiley New York
22. G. Piatetsky-Shapiro, and C. Connell Accurate estimation of the number of tuples satisfying a condition Proceedings of ACM-SIGMOD Conference 1984 256 276
23. W. Poosala, Histogram based estimation techniques in databases, PhD thesis, University of Wisconsin-Madison, 1997
24. E. Rich, and K. Knight Artificial Intelligence second ed. 1991 McGraw Hill New York
25. G. Romp Game Theory: Introduction & Applications 1997 Oxford University Press Oxford
26. S. Russell, and P. Norvig Artificial Intelligence: A Modern Approach 1995 Prentice-Hall New York
27. A. Webb Statistical Pattern Recognition 1999 Oxford University Press New York
28. A. Yuille, and M. Coughlan An A* perspective on deterministic optimization for deformable templates Pattern Recognition 33 2000 603 616