Linearity and contiguity are two parameters devoted to graph encoding. Linearity is a generalization of contiguity in the sense that every encoding achieving contiguity k induces an encoding achieving linearity k, both ...

Genetic algorithms have proved to be a useful improvement heuristic for tackling several combinatorial problems, including the coalition structure generation problem. In this case, the focus lies on selecting the best ...

© The Author(s) 2018.One of the main challenges that the industry faces when dealing with massive data for failure diagnosis is high dimensionality of such data. This can be tackled by dimensionality reduction method such ...

We describe a new quantifier elimination algorithm for real closed fields based onThom encoding and sign determination. The complexity of this algorithm is elemen-tary recursive and its proof of correctness is completely ...

This paper presents a new algorithm to solve the distribution power system restoration problem based on a joint application of tabu search (TS) algorithm and the node-depth encoding (NDE). The integration of NDE, its ...