Buscas alternativas:
algorithm complexity » algorithms complexity (Expandir a busca), algorithmic complexity (Expandir a busca)
algorithm complexity » algorithms complexity (Expandir a busca), algorithmic complexity (Expandir a busca)
1
Assuntos:
“...Complexity...”
Complexity analysis for a third-order algorithm to reach second-order stationarity
Tese
2
3
Assuntos:
“...Grovers algorithm...”
An introduction to quantum: computing, communication complexity protocols, nonlocality and graph parameters
Dissertação
4
Assuntos:
“...[en] ALGORITHM COMPLEXITY...”
[en] ARGUING NP = PSPACE: ON THE COVERAGE AND SOUNDNESS OF THE HORIZONTAL COMPRESSION ALGORITHM
Tese
5
6
Assuntos:
“...Parameterized complexity...”
Algorithms, parameters and complexity for graph partitioning problems
Tese
7
“... that require a small number of computations per input sample.The least mean squares (LMS) algorithm...”
Low-complexity approximations for the Kalman filter.
Tese
8
“... of a time series by revealing its frequency components. Then, we tackle the low-complexity parameter...”
Low-complexity methods for autoregressive signal modeling
Dissertação
9
10
“..., as the complexity of a domain grows, so does the size and complexity of the model that represents...”
Ontology-based complexity management in conceptual modeling
Tese
11
12
“... in computational complexity, which becomes cubic. The superiority of the algorithm with respect to alternative...”
On the regularization of the recursive least squares algorithm.
Dissertação
13
14
“... due to several limitations: the potential lack of sufficient data, the increased complexity and...”
Stream Ensemble: an ml model selection algorithm for stream data
Tese
15
“... problems by applying exact methods. However, due to the complexity of the problem, only heuristics result...”
Biased random-key genetic algorithm for warehouse reshuffling
Dissertação
16
Assuntos:
“...Algorithms complexity...”
Análise e comparação entre algoritmos de percolação
Dissertação
17
“... is presented for it, ensuring that unless P = NP there is no polynomial time algorithm with approxi mation...”
The k-labeled spanning forest problem : complexity, approximability, formulations and algorithms
Dissertação
18
Assuntos:
“...[en] PARAMETERIZED COMPLEXITY...”
[en] ANALYSIS OF MORSE MATCHINGS: PARAMETERIZED COMPLEXITY AND STABLE MATCHING
Tese
19
“... L and R are strongly connected. We then consider the complexity of deciding whether inv...”
Structural and complexity studies in inversions and colouring heuristics of (oriented) graphs
Tese
20
“... of low computational complexity'. An empirical test of this hypothesis is conducted, with results showing...”
Essays on decision sciences: exploring cognition, information processing, and complexity
Tese