Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
It has been shown in prior work in management science, statistics and machine learning that using an ensemble of models often results in better performance than using a single ‘...
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
We show in a model of spiking neurons that synaptic plasticity in the mushroom bodies in combination with the general fan-in, fan-out properties of the early processing layers of t...
A version space is a collection of concepts consistent with a given set of positive and negative examples. Mitchell [Mit82] proposed representing a version space by its boundary s...