There is growing interest in scaling up the widely-used decision-tree learning algorithms to very large data sets. Although numerous diverse techniques have been proposed, a fast ...
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...
Stavros Athanassopoulos, Ioannis Caragiannis, Chri...
This study describes an alternative concurrency approach in genetic algorithms. Inspiring from implicit parallelism in a physical chromosome, a vertical concurrency is introduced. ...
We analyze the five remaining AES candidate algorithms MARS, RC6, Rijndael, Serpent, and Twofish as well as DES, Triple DES, and IDEA by examining independently developed Java imp...
This paper reviews algorithms for local computation with imprecise probabilities. These algorithms try to solve problems of inference calculation of conditional or unconditional p...