Formal Concept Analysis

DOI10.1007/11671404zbMATH Open1177.68192OpenAlexW383789997MaRDI QIDQ5898486FDOQ5898486

Authors: Tushar S. Kulkarni, Bernd Schröder 

Publication date: 12 February 2007

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

Full work available at URL: https://doi.org/10.1007/11671404

Recommendations

• Stochastic enumeration method for counting trees
• Algorithm runtime prediction: methods \& evaluation
• Heuristic Sampling: A Method for Predicting the Performance of Tree Searching Programs
• scientific article; zbMATH DE number 1113993
• scientific article; zbMATH DE number 67459

zbMATH Keywords

enumerationconstraint satisfactionsearch

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics of partially ordered sets (06A07)

This page was built for publication: Formal Concept Analysis

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