In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating...
This paper considers localization of a source or a sensor from distance measurements. We argue that linear algorithms proposed for this purpose are susceptible to poor noise perfor...
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
We propose a dynamic programming algorithm for finding optimal transmission policies for a single packet in ratedistortion optimized media streaming. The algorithm relies on an op...
We present new results on a distributable changedetection method inspired by the natural immune system. A weakness in the original algorithm was the exponential cost of generating...
Patrik D'haeseleer, Stephanie Forrest, Paul Helman