— We define the concept of approximate domain optimizer for deterministic and expected value optimization criteria. Roughly speaking, a candidate optimizer is an approximate dom...
Andrea Lecchini-Visintini, John Lygeros, Jan M. Ma...
Abstract. We describe an approach for learning the model of the opponent in spatio-temporal negotiation. We use the Children in the Rectangular Forest canonical problem as an examp...
—We propose a non-coherent receiver for the fixed detect-and-forward relay channel and derive a closed-form tight upper bound on its bit error probability in Rayleigh fading cha...
—Designing a sensor network congestion avoidance algorithm is a challenging task due to the application specific nature of these networks. The frequency of event sensing is a de...
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...
Dino Sejdinovic, Robert J. Piechocki, Angela Doufe...