Let M be a fixed finite monoid. We consider the problem of implementing a data type containing a vector x ϭ ( x1, x2, . . . , xn) ʦ Mn , initially (1, 1, . . . , 1), with two kin...
Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, S...
Machine learning techniques such as tree induction have become accepted tools for developing generalisations of large data sets, typically for use with production rule systems in p...
Abstract-- High-throughput microarrays inform us on different outlooks of the molecular mechanisms underlying the function of cells and organisms. While computational analysis for ...
We report on a study that was undertaken to better identify users' goals behind web search queries by using click through data. Based on user logs which contain over 80 millio...
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...