Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
rigorous, and abstract— clearly defined and generally agreed—type inheritance model. To quote an article by Taivalsaari: “The basic idea of inheritance is quite simple ... [a...
The problem of obtaining the maximum a posteriori estimate of a general discrete random field (i.e. a random field defined using a finite and discrete set of labels) is known ...
Pawan Mudigonda, Vladimir Kolmogorov, Philip H. S....
Abstract. The classic NFL theorems are invariably cast in terms of single objective optimization problems. We confirm that the classic NFL theorem holds for general multiobjective ...
Background: While multiple alignment is the first step of usual classification schemes for biological sequences, alignment-free methods are being increasingly used as alternatives...
Eduardo Corel, Florian Pitschi, Ivan Laprevotte, G...