A comparative runtime analysis of heuristic algorithms for satisfiability problems

, &
Artificial Intelligence 173 (2):240-257 (2009)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2008.11.002

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,793

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Planning as satisfiability: parallel plans and algorithms for plan search.Jussi Rintanen, Keijo Heljanko & Ilkka Niemelä - 2006 - Artificial Intelligence 170 (12-13):1031-1080.
Generating hard satisfiability problems.Bart Selman, David G. Mitchell & Hector J. Levesque - 1996 - Artificial Intelligence 81 (1-2):17-29.
Mathematical runtime analysis for the non-dominated sorting genetic algorithm II (NSGA-II).Weijie Zheng & Benjamin Doerr - 2023 - Artificial Intelligence 325 (C):104016.
Heuristic evaluation functions in artificial intelligence search algorithms.Richard E. Korf - 1995 - Minds and Machines 5 (4):489-498.
Algorithm runtime prediction: Methods & evaluation.Frank Hutter, Lin Xu, Holger H. Hoos & Kevin Leyton-Brown - 2014 - Artificial Intelligence 206 (C):79-111.
Algorithms and conditional lower bounds for planning problems.Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger & Alexander Svozil - 2021 - Artificial Intelligence 297 (C):103499.
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems.Rina Dechter & Itay Meiri - 1994 - Artificial Intelligence 68 (2):211-241.
The satisfiability constraint gap.Ian P. Gent & Toby Walsh - 1996 - Artificial Intelligence 81 (1-2):59-80.
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems.Steven Minton, Mark D. Johnston, Andrew B. Philips & Philip Laird - 1992 - Artificial Intelligence 58 (1-3):161-205.
A formal analysis of why heuristic functions work.B. John Oommen & Luis G. Rueda - 2005 - Artificial Intelligence 164 (1-2):1-22.

Analytics

Added to PP
2020-12-22

Downloads
14 (#1,283,936)

6 months
5 (#1,012,768)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references