Saving support-checks does not always save time

DOI10.1023/B:AIRE.0000036261.28708.7FMaRDI QIDQ703123zbMATH OpenFDO

Authors M. R. C. van Dongen

Publication date 19 January 2005

Published in Artificial Intelligence Review (Search for Journal in Brave)

zbMATH Keywords

heuristicssearchConstraint satisfactiontime-complexitymaintain arc-consistencyspace-complexity

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Maintaining Arc Consistency Algorithms During the Search Without Additional Space Cost
• Arc consistency revisited
• scientific article; zbMATH DE number 2080311
• An optimal coarse-grained arc consistency algorithm
• On the arc consistency problem

Cited in

(2)

• scientific article; zbMATH DE number 1975613 (Why is no real title available?)
• scientific article; zbMATH DE number 2080311 (Why is no real title available?)

This page was built for publication: Saving support-checks does not always save time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703123)