— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
Marco Pavone, Nabhendra Bisnik, Emilio Frazzoli, V...
Modern applications are becoming increasingly more dynamic and flexible. In Java software, one important flexibility mechanism is dynamic class loading. Unfortunately, the vast ...
Hard problems for metaheuristic search can be a source of insight for developing better methods. We examine a challenging instance of such a problem that has exactly two local opt...
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Abstract. This paper addresses the problem of maximizing the capacity of multichannel slotted ALOHA networks subject to a userspecified deadline and a permissible probability of ex...