- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
A theoretical evaluation of selected backtracking algorithms
Artificial Intelligence 89 (1-2):365-387 (1997)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Backtracking algorithms for disjunctions of temporal constraints.Kostas Stergiou & Manolis Koubarakis - 2000 - Artificial Intelligence 120 (1):81-117.
Neural network ensembles: evaluation of aggregation algorithms.P. M. Granitto, P. F. Verdes & H. A. Ceccatto - 2005 - Artificial Intelligence 163 (2):139-162.
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems.Rina Dechter & Itay Meiri - 1994 - Artificial Intelligence 68 (2):211-241.
A Study of Evaluation Metrics for Recommender Algorithms.Jennifer Redpath, Mary Shapcott, Sally McClean & Luke Chen - forthcoming - The Proceedings of the 19th Irish Conference on Artificial Intelligence and Cognitive Science.
Hybrid backtracking bounded by tree-decomposition of constraint networks.Philippe Jégou & Cyril Terrioux - 2003 - Artificial Intelligence 146 (1):43-75.
Result diversification by multi-objective evolutionary algorithms with theoretical guarantees.Chao Qian, Dan-Xuan Liu & Zhi-Hua Zhou - 2022 - Artificial Intelligence 309 (C):103737.
Backjump-based backtracking for constraint satisfaction problems.Rina Dechter & Daniel Frost - 2002 - Artificial Intelligence 136 (2):147-188.
Search rearrangement backtracking and polynomial average time.Paul Walton Purdom - 1983 - Artificial Intelligence 21 (1-2):117-133.
Backtracking techniques for the job shop scheduling constraint satisfaction problem.Norman Sadeh, Katia Sycara & Yalin Xiong - 1995 - Artificial Intelligence 76 (1-2):455-480.
Geometric backtracking for combined task and motion planning in robotic systems.Julien Bidot, Lars Karlsson, Fabien Lagriffoul & Alessandro Saffiotti - 2017 - Artificial Intelligence 247 (C):229-265.
Analytics
Added to PP
2020-12-22
Downloads
8 (#1,577,261)
6 months
6 (#820,766)
2020-12-22
Downloads
8 (#1,577,261)
6 months
6 (#820,766)
Historical graph of downloads
Citations of this work
A theoretical evaluation of selected backtracking algorithms.Grzegorz Kondrak & Peter van Beek - 1997 - Artificial Intelligence 89 (1-2):365-387.
Backtracking algorithms for disjunctions of temporal constraints.Kostas Stergiou & Manolis Koubarakis - 2000 - Artificial Intelligence 120 (1):81-117.
On the relations between intelligent backtracking and failure-driven explanation-based learning in constraint satisfaction and planning.Subbarao Kambhampati - 1998 - Artificial Intelligence 105 (1-2):161-208.
On forward checking for non-binary constraint satisfaction.Christian Bessière, Pedro Meseguer, Eugene C. Freuder & Javier Larrosa - 2002 - Artificial Intelligence 141 (1-2):205-224.
On point-duration networks for temporal reasoning.I. Navarrete, A. Sattar, R. Wetprasit & R. Marin - 2002 - Artificial Intelligence 140 (1-2):39-70.
References found in this work
Increasing tree search efficiency for constraint satisfaction problems.Robert M. Haralick & Gordon L. Elliott - 1980 - Artificial Intelligence 14 (3):263-313.
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition.Rina Dechter - 1990 - Artificial Intelligence 41 (3):273-312.
A theoretical evaluation of selected backtracking algorithms.Grzegorz Kondrak & Peter van Beek - 1997 - Artificial Intelligence 89 (1-2):365-387.
Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics.Bernard Nudel - 1983 - Artificial Intelligence 21 (1-2):135-178.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-cvrck dc2