ALGORITHMS - tradução para Inglês

• algorithms

Exemplos de uso de Algorithms em Português e suas traduções para o Inglês

In terms of approximation algorithms, Vizing's algorithm shows that the edge chromatic number can be approximated within 4/3,and the hardness result shows that no(4/3-"ε")-algorithm exists for any"ε> 0" unless P NP.
In terms of approximation algorithms, Vizing's algorithm shows that the edge chromatic number can be approximated to within 4/3,and the hardness result shows that no(4/3-"ε")-algorithm exists for any"ε> 0" unless P NP.

Para atingir os objetivos esperados foi utilizado o algoritmo genético nsga-ii(non-dominated sorting genetic algorithms- ii)
To achieve the expected objectives genetic algorithm nsga-ii(non-dominated sorting genetic algorithms- ii) was used in

O gapf(genetic algorithms for protein folding)
Gapf(genetic algorithms for protein folding)

Nesse contexto, foi desenvolvido o java parallel evolutionary algorithms generator(jpeag), um software web que cria automaticamente código java que implementa algoritmos genéticos paralelos
In this context, it was developed the java parallel evolutionary algorithms generator(jpeag), a web-based software that automatically creates java code for parallel genetic algorithms

Concebeu a noção de algoritmos de cache alheio(cache-oblivious algorithms), que são algoritmos que não têm parâmetros de ajuste para o tamanho do cache ou comprimento de linha de cache, mas, no entanto, usa cache quase ótimo.
He conceived of the notion of cache-oblivious algorithms, which are algorithms that have no tuning parameters for cache size or cache-line length, but nevertheless use cache near-optimally.

the null space may be computed by any of the various algorithms designed to solve homogeneous systems.
instance of solving a homogeneous system of linear equations, the kernel may be computed by any of the various algorithms designed to solve homogeneous systems.

Fortnow& Homer(2003) datam o início dos estudos sistemáticos em complexidade computacional com o importante artigo"On the Computational Complexity of Algorithms" de Juris Hartmanis
The beginning of systematic studies in computational complexity is attributed to the seminal 1965 paper"On the Computational Complexity of Algorithms" by Juris Hartmanis

denominado tasnop- teaching algorithms for solving network optimization problems,
called tasnop- teaching algorithms for solving network optimization problems,

tuza j. algorithms 45(2002), 40--54.
tuza 2 j. algorithms 45(2002), 40--54.

Stockholm 1884 Congruência de Zeller This leads to a comprehensive biographical resource on Zeller Mainly on Zeller's algorithms.
Paris 1881 Zu Eulers Rekursionsformel für die Divisorensummen, Stockholm 1884 Biography(in German) Mainly on Zeller's algorithms.

Stockholm 1884==Ver também==*Congruência de Zeller==Ligações externas==*This leads to a comprehensive biographical resource on Zeller*Mainly on Zeller's algorithms.
Stockholm 1884==See also==* Zeller's Congruence==External links==*This leads to a comprehensive biographical resource on Zeller*Mainly on Zeller's algorithms.

As soluções geradas cobrem boa parte dos casos e levam microsegundos nos computadores mais recentes.( em inglês) Inverse Kinematics algorithms( em inglês) Robot Inverse Kinematics( em inglês)
Inverse Kinematics algorithms Robot Inverse solution for a common robot geometry HowStuffWorks.

the Computational Geometry Algorithms Library:***- Code for Convex Hull,
the Computational Geometry Algorithms Library:***- Code for Convex Hull,

Valiant LG, Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings",
Valiant L. G.,"Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings", Journal of Computer

XDSSC os ficheiros estão Ficheiros de Texto principalmente associados ao Data Structure for the Security Suitability of Cryptographic Algorithms Fraunhofer SIT, pawisda systems GmbH, Fraunhofer Gesellschaft.
XDSSC files are Text Files primarily associated with Data Structure for the Security Suitability of Cryptographic Algorithms Fraunhofer SIT, pawisda systems GmbH, Fraunhofer Gesellschaft.

Nenhum outro curso on-line em Algorithms chega perto de oferecer a vocÃa uma variedade de desafios de programação que vocÃa pode enfrentar em sua prÃ3xima entrevista de emprego.
No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview.

DSSC os ficheiros estão Ficheiros de Texto principalmente associados ao Data Structure for the Security Suitability of Cryptographic Algorithms Fraunhofer SIT, pawisda systems GmbH, Fraunhofer Gesellschaft.
DSSC files are Text Files primarily associated with Data Structure for the Security Suitability of Cryptographic Algorithms Fraunhofer SIT, pawisda systems GmbH, Fraunhofer Gesellschaft.

Wilfredo:"Iterative algorithms for equilibrium problems.
Wilfredo Iterative algorithms for equilibrium problems.

com o título da tese Open source implementations of encoding algorithms for vídeo distribution in the HTML5 era.
Natural Sciences, with a thesis on"Open Source Implementations of Encoding Algorithms for Video Distribution in the HTML5 Era”.

mediante as técnicas utilizadas por. Evolution Algorithms, pode resolver-se em poucos minutos.
by the techniques used by Evolution Algorithms, can be solved in minutes.