We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
When different subsamples of the same data set are used to induce classification trees, the structure of the built classifiers is very different. The stability of the structure of ...
Abstract. In this paper we introduce a new approach to automatic attribute and granularity selection for building optimum regression trees. The method is based on the minimum descr...
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...