In this computational complexity framework, an algorithm for a general enumeration problem is regarded efficient if it is output-sensitive, i.e., its running time is bounded by a polynomial in the input and the
In this paper, we study the complexity of checking ioco. We show that the problem of checking ioco is PSPACE-complete. To provide a more efficient algorithm, we propose a more restricted setting for checking ioco, namely with deterministic models and show that in this restricted setting ioco ...
In this paper we propose an efficient linear complexity algorithm for the automatic generation of convex Multiple Input Multiple Output (MIMO) instructions, whose convexity is theoretically guaranteed. The proposed approach is not restricted to basic-block level and does not impose limitations either on...
the computational complexity of the sequence producing algorithm; 2. the control of the linear complexity of the keystream sequences and of the size of the period; 3. the control of the sphere complexity of the keystream sequences; 4. the control of the frequency distribution of the elements...
(RLS) of the FIR filter weights. The System object estimates the filter weights or coefficients, needed to convert the input signal into the desired signal. The input signal can be a scalar or a column vector. The desired signal must have the same data type, complexity, and dimensions as ...
k is set dynamically based on bounds given by the streaming algorithm. 3. For every request: • Increases the reference counter for the data item referenced by the request and decreases the counter for the request falling out of the window. • If the data requested is not in cache, it...
but this strategy is characterized by the presence of large ripples at the level of both active and reactive powers. This work presents a new algorithm for DFOC strategy of an asynchronous generator (AG) in a wind power (WP) system, which is based on the use of a new nonlinear controller...
Untethered miniature soft robots have significant application potentials in biomedical and industrial fields due to their space accessibility and safe human interaction. However, the lack of selective and forceful actuation is still challenging in revolu
It is a generalised approach to visualise the contributions of non-linear classifiers by a pixel-wise decomposition of each pixel's output prediction. Starting from the output layer, the algorithm assigns a relevance (importance score) to the target neuron equal to the neuron's output. At the ...
If the stimulus–response characteristics were available, the Blahut-Arimoto algorithm (Cover and Thomas, 2006) could be used to compute capacity. The primary difficulty arises because the quantities of interest depend critically on the joint distribution pX,Y(x,y) over very-high-dimensional stimuli...