A formal analysis of why heuristic functions work

[1]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[2]  Donald L. Kreher,et al.  Combinatorial algorithms: generation, enumeration, and search , 1998, SIGA.

[3]  E. Deeba,et al.  Interactive Linear Algebra with Maple V , 1998 .

[4]  Stavros Christodoulakis,et al.  On the propagation of errors in the size of join results , 1991, SIGMOD '91.

[5]  Nils J. Nilsson,et al.  Artificial Intelligence: A New Synthesis , 1997 .

[6]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[7]  Andrew R. Webb,et al.  Statistical Pattern Recognition , 1999 .

[8]  Alan L. Yuille,et al.  An A* perspective on deterministic optimization for deformable templates , 2000, Pattern Recognit..

[9]  Gregory Piatetsky-Shapiro,et al.  Accurate estimation of the number of tuples satisfying a condition , 1984, SIGMOD '84.

[10]  Kevin Knight,et al.  Artificial intelligence (2. ed.) , 1991 .

[11]  Keinosuke Fukunaga,et al.  Introduction to statistical pattern recognition (2nd ed.) , 1990 .

[12]  David G. Stork,et al.  Pattern Classification , 1973 .

[13]  L. Bauwens,et al.  Econometrics , 2005 .

[14]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[15]  M. Newborn,et al.  How Computers Play Chess , 1990, J. Int. Comput. Games Assoc..

[16]  John B. Oommen,et al.  RectangularAttrib ute Cardinality Map: A NewHistogram-lik eTechniquefor Query Optimization , 1999 .

[17]  Viswanath Poosala.  Histogram-Based Estimation Techniques in Database Systems , 1997 .

[18]  Peter Norvig,et al.  A modern, agent-oriented approach to introductory artificial intelligence , 1995, SGAR.

[19]  B. John Oommen,et al.  Graph Partitioning Using Learning Automata , 1996, IEEE Trans. Computers.

[20]  D. DeWitt,et al.  Equi-depth multidimensional histograms , 1988, SIGMOD '88.

[21]  C. McDiarmid.  SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing , 1991 .

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  B. John Oommen,et al.  Query result size estimation using the Trapezoidal Attribute Cardinality Map , 2000, Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789).

[24]  Michael V. Mannino,et al.  Statistical profile estimation in database systems , 1988, CSUR.

[25]  Stavros Christodoulakis,et al.  Estimating selectivities in data bases , 1982 .

[26]  B. John Oommen,et al.  Query result size estimation using a novel histogram-like technique: the rectangular attribute cardinality map , 1999, Proceedings. IDEAS'99. International Database Engineering and Applications Symposium (Cat. No.PR00265).

[27]  Keinosuke Fukunaga,et al.  Introduction to Statistical Pattern Recognition , 1972 .

[28]  Robert Kooi,et al.  The Optimization of Queries in Relational Databases , 1980 .

[29]  B. John Oommen,et al.  The Efficiency of Histogram-like Techniques for Database Query Optimization , 2002, Comput. J..

[30]  Graham Romp.  Game Theory: Introduction and Applications , 1997 .