We introduce a new data structuring paradigm in which operations can be performed on a data structure not only in the present but also in the past. In this new paradigm, called ret...
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Genetic algorithms are best suited for optimization problems involving large search spaces. The problem space encountered when optimizing the transmission parameters of an agile or...
Timothy R. Newman, Rakesh Rajbanshi, Alexander M. ...
In this paper, we propose an iterative algorithm for multiple regression with fuzzy variables.While using the standard least-squares criterion as a performance index, we pose the ...
Andrzej Bargiela, Witold Pedrycz, Tomoharu Nakashi...
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...