Result: Maintaining arc consistency algorithms during the search without additional space cost
Title:
Maintaining arc consistency algorithms during the search without additional space cost
Authors:
Source:
Principles and practice of constraint programming - CP 2005 (11th international conference, CP 2005, Sitges, Spain, October 1-5, 2005, proceedings)Lecture notes in computer science. :520-533
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 13 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme recherche, Search algorithm, Algoritmo búsqueda, Arbre recherche, Search tree, Arbol investigación, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Complexité espace, Space complexity, Complejidad espacio, Complexité temps, Time complexity, Complejidad tiempo, Consistance arc, Arc consistancy, Contrainte binaire, Maintaining arc consistency algorithm (MAC)
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Computing and Information Science, Cornell University, Ithaca NY 14850, United States
ISSN:
0302-9743
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17324976
Database:
PASCAL Archive
Further Information
In this paper, we detail the versions of the arc consistency algorithms for binary constraints based on list of supports and last value when they are maintained during the search for solutions. In other words, we give the explicit codes of MAC-6 and MAC-7 algorithms. Moreover, we present an original way to restore the last values of AC-6 and AC-7 algorithms in order to obtain a MAC version of these algorithms whose space complexity remains in O(ed) while keeping the O(ed2) time complexity on any branch of the tree search, where d is the size of the largest domain and e is the number of constraints. This result outperforms all previous studies.