—Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This paper analyzes coalescence time ...
—We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree wi...
Standard pattern discovery techniques, such as association rules, suffer an extreme risk of finding very large numbers of spurious patterns for many knowledge discovery tasks. The...
Bayesian Networks are today used in various fields and domains due to their inherent ability to deal with uncertainty. Learning Bayesian Networks, however is an NP-Hard task [7]....
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...