Trying to learn how to translate from the human translation examples.
From professional translators, enterprises, web pages and freely available translation repositories.
astronomical algorithms de jean meeus
astronomical algorithms by jean meeus
Last Update: 2011-10-23
Usage Frequency: 2
Quality:
chapter 35: approximation algorithms, pp.
chapter 35: approximation algorithms, pp.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
"ant algorithms for discrete optimization".
"ant algorithms for discrete optimization".
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
"algorithms, graphs and computers"*1972.
"algorithms, graphs and computers"* 1972.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
"introduction to algorithms", second edition.
"introduction to algorithms", second edition.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
however , two algorithms shall not run simultaneously .
however , two algorithms shall not run simultaneously .
Last Update: 2011-10-23
Usage Frequency: 1
Quality:
different optimisation mechanisms ( algorithms ) are used .
different optimisation mechanisms ( algorithms ) are used .
Last Update: 2011-10-23
Usage Frequency: 1
Quality:
during daytime processing the algorithms shall run sequentially .
during daytime processing the algorithms shall run sequentially .
Last Update: 2011-10-23
Usage Frequency: 2
Quality:
cf: chapter 2, "algorithms and turing machines".
cf: chapter 2, "algorithms and turing machines".
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
can new algorithms reveal the phylogeny and even prehistory of ie?
can new algorithms reveal the phylogeny and even prehistory of ie?
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
conventional symmetric encryption algorithms use complex patterns of substitution and transpositions.
conventional symmetric encryption algorithms use complex patterns of substitution and transpositions.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
"approximation algorithms for np-hard problems, pws publishing company, 1997.
"approximation algorithms for np-hard problems", pws publishing company, 1997.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
volume a: algorithms and complexity", the mit press/elsevier, 1990.
volume a: algorithms and complexity", the mit press/elsevier, 1990.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
* "algorithms" (coauthored with sanjoy dasgupta and umesh vazirani).
* "algorithms" (coauthored with sanjoy dasgupta and umesh vazirani).
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
* "combinatorial optimization: algorithms and complexity" (com kenneth steiglitz).
prentice-hall, 1982; second edition september 1997. greek edition* "combinatorial optimization: algorithms and complexity" (with kenneth steiglitz).
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting
however, these latter algorithms are only faster than schönhage–strassen for impractically large inputs.
however, these latter algorithms are only faster than schönhage–strassen for impractically large inputs.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
asymmetric encryption algorithms depend on mathematical problems that are thought to be difficult to solve, such as integer factorization and discrete logarithms.
asymmetric encryption algorithms depend on mathematical problems that are thought to be difficult to solve, such as integer factorization and discrete logarithms.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
* oat (optimization algorithm toolkit) - a set of standard optimization algorithms and problems in java.
573–629);** a. h. g. rinnooy kan and g. t. timmer, global optimization (pp.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
de 1988 a 1995 e de 1999 até os dias de hoje ele também tem sido pesquisador no international computer science institute em berkeley, onde ele atualmente lidera o algorithms group.
from 1988 to 1995 and 1999 to the present he has also been a research scientist at the international computer science institute in berkeley, where he currently leads the algorithms group.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
"hierarchical geometric models for visible surface algorithms" by james h. clark, university of california at santa cruz.
"hierarchical geometric models for visible surface algorithms" by james h. clark, university of california at santa cruz.
Last Update: 2016-03-03
Usage Frequency: 1
Quality:
Warning: Contains invisible HTML formatting