Labelling heuristics for CSP application domains

DOI10.1007/3-540-45578-7_70MaRDI QIDQ4475701zbMATH OpenFDO

Authors Zeynep Kiziltan

Publication date 9 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390769.htm

Mathematics Subject Classification ID

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

Recommendations

• Towards inferring labelling heuristics for CSP application domains
• scientific article; zbMATH DE number 1234562
• Artificial Intelligence: Methodology, Systems, and Applications
• Counting-based search: branching heuristics for constraint satisfaction problems
• Constraint satisfaction problems: Algorithms and applications

Cited in

(1)

• Towards inferring labelling heuristics for CSP application domains

This page was built for publication: Labelling heuristics for CSP application domains

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