Abstract. Two extensions of the original Wilson’s editing method are introduced in this paper. These new algorithms are based on estimating probabilities from the k-nearest neigh...
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
Abstract. Evolutionary Algorithms (EAs) are population-based randomized optimizers often solving problems quite successfully. Here, the focus is on the possible effects of changin...
Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
This paper presents results from a number of experiments within the area of competitive co-evolutionary robotics. The focus in these experiments has been on ‘co-evolving’ parts...