Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
In this paper, we propose a distributed solution to the problem of configuring classifier trees in distributed stream mining systems. The configuration involves selecting appro...
Hyunggon Park, Deepak S. Turaga, Olivier Verscheur...
This paper considers the problem of estimating the power breakdowns for the main appliances inside a building using a small number of power meters and the knowledge of the ON/OFF ...