Buscas alternativas:
algorithm complexity » algorithms complexity (Expandir a busca), algorithmic complexity (Expandir a busca)
complexity from » complexity freedom (Expandir a busca), complexity of (Expandir a busca), complex from (Expandir a busca)
algorithm complexity » algorithms complexity (Expandir a busca), algorithmic complexity (Expandir a busca)
complexity from » complexity freedom (Expandir a busca), complexity of (Expandir a busca), complex from (Expandir a busca)
1
Assuntos:
“...Grovers algorithm...”
An introduction to quantum: computing, communication complexity protocols, nonlocality and graph parameters
Dissertação
2
Assuntos:
“...[en] ALGORITHM COMPLEXITY...”
[en] ARGUING NP = PSPACE: ON THE COVERAGE AND SOUNDNESS OF THE HORIZONTAL COMPRESSION ALGORITHM
Tese
3
Assuntos:
“...Parameterized complexity...”
Algorithms, parameters and complexity for graph partitioning problems
Tese
4
“... that require a small number of computations per input sample.The least mean squares (LMS) algorithm...”
Low-complexity approximations for the Kalman filter.
Tese
5
“..., 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
6
“... 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
8
“..., which rely on the complementary use of multiple base models, often suffer from high execution costs and...”
Stream Ensemble: an ml model selection algorithm for stream data
Tese
9
“... 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
10
Assuntos:
“...[en] PARAMETERIZED COMPLEXITY...”
[en] ANALYSIS OF MORSE MATCHINGS: PARAMETERIZED COMPLEXITY AND STABLE MATCHING
Tese
11
“... R, the dijoin from L to R, denoted by L → R, is the oriented graph formed by the disjoint union of L and...”
Structural and complexity studies in inversions and colouring heuristics of (oriented) graphs
Tese
12
“... 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
13
Assuntos:
“...[en] COMPLEXITY COMPUTATIONAL...”
[pt] AVALIAÇÃO DE ALGORITMOS DE DETECÇÃO DE ESPAÇOS ESPECTRAIS BRANCOS PARA APLICAÇÕES DE RÁDIO COGNITIVO
Tese
14
Assuntos:
“...Gaussian elimination algorithm...”
Metodo para a determinação do numero de gaussianas em modelos ocultos de Markov para sistemas de reconhecimento de fala continua
Tese
15
Assuntos:
“...[en] LINEAR ALGORITHM...”
[en] AN ALGORITHM FOR THE COMPUTATION OF SOME DISTANCE FUNCTIONS BETWEEN CONVEX POLYGONS
Tese
16
17
“... to form super-channels, thus changing the paradigm of the network from fixed-size WDM channels to variable...”
A fairness-focused spectrum assignment algorithm for elastic optical networks
Tese
18
19
20
Assuntos:
“...Complexity...”
First-order regularized algorithms with complexity properties for order-valued and low-order-valued optimization problems
Tese