The value 1 problem is a decision problem for probabilistic automata on finite words: given a probabilistic automaton A, are there words accepted by A with probability arbitraril...
We developed new parameterized Particle-in-Cell algorithms and data structures for emerging multi-core and many-core architectures. Four parameters allow tuning of this PIC code t...
Abstract--An approach for the construction of a family of desired order continuous polynomial time window functions is presented without self-convolution of the parent window. The ...
In the last few years, the growing complexity of the electrical power networks, mainly due to the increased use of electronic converters together with the requirements of a higher ...
Andrea Benigni, Gabriele D'Antona, U. Ghisla, Anto...
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...