Buscas alternativas:
complexity on » complexity of (Expandir a busca), complexity in (Expandir a busca), complexity and (Expandir a busca)
algorithms » algorithm (Expandir a busca)
complexity on » complexity of (Expandir a busca), complexity in (Expandir a busca), complexity and (Expandir a busca)
algorithms » algorithm (Expandir a busca)
1
2
Assuntos:
“...Exact algorithms...”
Algorithms, parameters and complexity for graph partitioning problems
Tese
3
“... of NP-completeness and efficient algorithms for certain convexity parameters for this new one, as well as approximate...”
Complexity and algorithms related to two classes of graph problems
Tese
4
“... compared to the best known algorithms in the literature, our matheuristic outperformed the other proposals...”
The k-labeled spanning forest problem : complexity, approximability, formulations and algorithms
Dissertação
5
“... complexity O(√N ), where N is the domain size of the function. For the case of a 1024-bit key, Grover...”
Cryptographic algorithms based on Ramanujan graphs
Tese
6
7
8
Assuntos:
“...Low complexity...”
Nonlinear adaptive algorithms with tensor rank decompositions.
Tese
9
Assuntos:
“...Computational complexity...”
Complexidade computacional e o problema P vs NP
Dissertação
10
11
“... we propose two new data sampling algorithms: RRUS and k-INOS. RRUS is an under-sampling algorithm that aims...”
New sampling algorithms for enhancing classifier performance on imbalanced data problems
Dissertação
12
Assuntos:
“...Quantum algorithms...”
An introduction to quantum: computing, communication complexity protocols, nonlocality and graph parameters
Dissertação
13
14
Assuntos:
“...Complexity of Algorithms...”
Avaliação de Usabilidade e Aprendizagem de Algoritmos com o uso do TuPy Online
Dissertação
15
“... environments. However, as they are usually applied in real-time applications, they must be based on algorithms...”
Low-complexity approximations for the Kalman filter.
Tese
17
Assuntos:
“...Approximation algorithms...”
The k-hop connected dominating set problem: approximation algorithms and hardness results
Tese
18
“... regard, new clustering algorithms have been proposed, in which the correlation and relevance of variables...”
Clustering algorithms with new automatic variables weighting
Tese