In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...
We study the possibility of constructing decision trees with evolutionary algorithms in order to increase their predictive accuracy. We present a self-adapting evolutionary algori...
We consider two models commonly used in the literature to model adversarial injection of packets into a packet switching network. We establish the relation between these two types...
Given a decision problem P and a probability distribution over binary strings, for each n, draw independently an instance xn of P of length n. What is the probability that there i...
Andreas Blass, Yuri Gurevich, Vladik Kreinovich, L...
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
E. Demenkov, Arist Kojevnikov, Alexander S. Kuliko...