We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...
In the paper, the computational complexity of several variants of the problem of isothermic DNA sequencing by hybridization, is analyzed. The isothermic sequencing is a recent met...
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
In our terminology, a “deliberation” is a distributed collaborative process, more or less spontaneous, structured, and complex. This process can include both individual and col...