Abstract Due to complexity and intractability reasons, most of the analytical studies on the reliability of communication paths in mobile ad hoc networks are based on the assumptio...
This paper describes design of a low-complexity algorithm for adaptive encoding/decoding of binary sequences produced by memoryless sources. The algorithm implements universal blo...
This paper is the second part of a series of two papers dealing with bulking: a way to define quasi-order on cellular automata by comparing space-time diagrams up to rescaling. In...
Marianne Delorme, Jacques Mazoyer, Nicolas Ollinge...
We propose the use of scatter search with path relinking for the inference of phylogenetic trees. Solutions are here represented as trees whose leaves span the set of species unde...
We study the behavior of simple, 2-D, self-organizing primitives that interact and move in an unbounded environment to create aggregated shapes. Each primitive is represented by a ...