We consider the problem of efficiently designing sets (codes) of equal-length DNA strings (words) that satisfy certain combinatorial constraints. This problem has numerous motivati...
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
We investigate the properties of a multiagent system where each (distributed) agent locally perceives its environment. Upon perception of an unexpected event, each agent locally c...
Gauvain Bourgne, Gael Hette, Nicolas Maudet, Suzan...
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
Abstract—Wireless sensor networks are evolving from singleapplication platforms towards an integrated infrastructure shared by multiple applications. Given the resource constrain...