Anmerkungen:
Hinweis: Link zum Artikel der zuerst in der Zeitschrift „Annals of mathematics and artificial intelligence” bei Springer erschienen ist. DOI: 10.1007/s10472-022-09826-x
Beschreibung:
A simple search problem is studied in which a binary n-tuple is to be found in a list, by sequential bit comparisons with cost. The problem can be solved (for small n) using dynamic programming. We show how the “bottom up” part of the algorithm can be organized by means of Formal Concept Analysis.