Automated Search for Heuristic Functions

  • Pavel Cejnar
  • Roman Barták
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3709)

Abstract

The computer constructed local search heuristic function for a SAT problem can run and solve SAT faster than human designed heuristics. The idea behind this was to start with some predefined primitives chosen in accordance with a human observation and to combine them using genetic programming. This leads to a question whether it is possible to construct an effective heuristic function solely by a computer, a function constructed from very elementary program building blocks not only from predefined higher-level primitives.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Pavel Cejnar
    • 1
  • Roman Barták
    • 1
  1. 1.Faculty of Mathematics and PhysicsCharles UniversityPraha 1Czech Republic

Personalised recommendations