programming algorithm中文是什么意思

發(fā)音:

中文翻譯
造句

程序設(shè)計(jì)算法

algorithm n. 【數(shù)學(xué)】算法；規(guī)則系統(tǒng)；演段。
algorithm programming 程式設(shè)計(jì)演算法; 程序設(shè)計(jì)算法
algorithm oriented programming 面向算術(shù)運(yùn)算的程序設(shè)計(jì)
dynamic programming algorithm 動(dòng)態(tài)規(guī)劃算法
forward dynamic programming algorithm 前推動(dòng)態(tài)規(guī)劃算式
integer programming algorithm 整數(shù)規(guī)劃算法; 整數(shù)規(guī)則劃算法
quasilinear programming algorithm 準(zhǔn)線(xiàn)性程序算法
the algorithm 算法
programming 編程序的; 編程序規(guī)劃計(jì)劃; 程式設(shè)計(jì)，計(jì)畫(huà)擬編; 程式撰寫(xiě); 程序編寫(xiě); 程序化; 程序控制的; 程序設(shè)計(jì),程序編制; 程序設(shè)計(jì)，編制程序; 規(guī)劃；程序設(shè)計(jì)，程序編制; 規(guī)劃；設(shè)計(jì)方案，編制程序；程序設(shè)計(jì); 和諧編制; 計(jì)算機(jī)程序設(shè)計(jì); 節(jié)目制作; 施工時(shí)間安排；工程程序；工程進(jìn)度; 數(shù)控編程實(shí)習(xí)室; 用語(yǔ); 張曉欣上海交通大學(xué) 城市規(guī)劃本科
access algorithm 存取算法
adaptive algorithm 自適應(yīng)算法
add algorithm 遞增算法
address algorithm 地址運(yùn)算
adjusting algorithm 調(diào)整算法
admissible algorithm 可采納算法
agglomerative algorithm 凝聚算法
algorithm analysis 算法分析一個(gè)軟件的驗(yàn)證確認(rèn)任務(wù)，用于保證選擇的算法是正確的、合適的和穩(wěn)定的，并且滿(mǎn)足所有精確性、規(guī)模和時(shí)間方面的要求。
algorithm attribute 算術(shù)屬性
algorithm availability 算法有效性
algorithm block 算法字組
algorithm bus 運(yùn)算總線(xiàn)
algorithm chart 算法圖
algorithm classification 算法分類(lèi)
algorithm coding 算術(shù)編碼
programming and budgeting department 規(guī)劃和預(yù)算編制局
programming aids 程序設(shè)計(jì)工具

"查查詞典"手機(jī)版

千萬(wàn)人都在用的超大詞匯詞典翻譯APP

例句與用法

This paper presents a bidding model of power market and resolves it by a new interior point nonlinear programming algorithm for optimal power flow problems ( opf ) based on the perturbed kkt conditions of the primal problem . at the same time , it discusses the implementation of a bidding system based on web
本文基于原問(wèn)題擾動(dòng)karush - kuhn - tucker ( kkt )條件的現(xiàn)代內(nèi)點(diǎn)最優(yōu)化算法，完成了電力市場(chǎng)競(jìng)價(jià)模型的建立和求解，并初步討論了一種基于web的競(jìng)價(jià)交易系統(tǒng)之實(shí)現(xiàn)。
As more and more genome sequencing projects are accomplished one after another , the amount of sequence data has been exponentially increased , the demand for efficient alignment algorithm in sequence analysis is increasingly urgent . based on the concept of sequence segmentation , we applied the multiple - stage dynamic programming algorithm in pairwise alignment to devise a new algorithm named samidp and developed the corresponding programs in visualbasic , we find that samidp not only reduces the computation complexity to o ( n ) , but also obtains even satisfactory accuracy , and it is expected that the new algorithm will be important in global sequence alignment
基于段與段比對(duì)的概念，我們?cè)O(shè)計(jì)了一個(gè)用于核酸序列全局比對(duì)的新算法samidp ( sequencealignmentbasedonmultiplestageintelligentdynamicprogrammingalgorithm ) ，將多階段動(dòng)態(tài)規(guī)劃決策算法用于兩兩序列比對(duì)并用visualbasic編程實(shí)現(xiàn)，結(jié)果發(fā)現(xiàn)該新算法在將計(jì)算復(fù)雜度減小到o ( n )的同時(shí)，也能夠獲得較為理想的計(jì)算精度，預(yù)期將在序列全局比對(duì)中起重要作用。
So a lot of researchers have attached importance to optimization computing , and put forward all kinds of algotithms for optimization problems , for instance : simplex algorithm , dynamic programming algorithm , branch - bound algorithm , etc . but these algorithms are all disadvantage and can not be applied to complex nonlinear optimization problems
為了解決各種優(yōu)化計(jì)算問(wèn)題，人們提出了各種各樣的優(yōu)化計(jì)算方法，如單純形法、梯度法、動(dòng)態(tài)規(guī)劃法、分枝剪界法。這些優(yōu)化算法各有各的長(zhǎng)處，各有各的適用范圍，也有各自的限制。
The paper showed a way combining kbs ( knowledge based system ) and cbr ( case based ratiocination ) to choose the transport routes , and proposed a programmed algorithm based on a method of the fixed train path by the regular characteristic of artsr , which could arrange the train schedule on the chosen transport routes
從特殊需求的自身規(guī)律出發(fā)，運(yùn)用知識(shí)系統(tǒng)和案例推理相結(jié)合的方法選擇運(yùn)輸徑路，設(shè)計(jì)基于固定點(diǎn)號(hào)的運(yùn)行計(jì)劃安排算法，在選定的運(yùn)輸徑路上安排運(yùn)行計(jì)劃。
As an application of succeeding , a numerical example of max - cut is given . 3 . several semidefinite relaxation detection strategies of the cdma maximum likelihood multiuser detection are investigated . rounding , coordinate descent , cutting plane and branch and bound based on quadratic programming algorithm are presented to get the suboptirnal solution
本文紿出了基于半定規(guī)劃模型尋求多用戶(hù)檢測(cè)問(wèn)題次優(yōu)解的幾種重要方法，包括隨機(jī)擾動(dòng)法、坐標(biāo)下降法、半定規(guī)劃的割平面法和二次規(guī)劃的分枝定界法等
Seventhly , technology reference model for network attack deception and program algorithms - based attack deception method are suggested ; the deception technologies for network scanning is studied ; the deception software system prototype of anti - webscanner is implemented ; the experimentation data shows that it has good effect
提出網(wǎng)絡(luò)攻擊誘騙技術(shù)參考模型和基于程序算法攻擊誘騙對(duì)抗方法，側(cè)重研究網(wǎng)絡(luò)掃描誘騙技術(shù)，實(shí)現(xiàn)對(duì)抗web攻擊掃描的誘騙軟件系統(tǒng)原型，并給出相關(guān)實(shí)驗(yàn)數(shù)據(jù)。
In addition , we summarize some spatial join algorithms based on r - tree index and their cost estimation models . we also give out a query optimization algorithm framework based on dynamic programming algorithm , and integrated basic r - tree index method and query optimization mechanism into sadbs ii
另外，本文還總結(jié)了幾種基于r樹(shù)索引的空間連接算法及其代價(jià)評(píng)估模型，利用動(dòng)態(tài)編程算法給出了查詢(xún)優(yōu)化的算法框架，并在sadbs中集成了基本的r樹(shù)索引方法和查詢(xún)優(yōu)化機(jī)制。
In the paper , we firstly summarize the theory , algorithm , application and recent research of semidefinite programming , then , introduce our some work in algorithm and application . for detail , we conclude them as follows : 1 . a nonlinear programming algorithm was proposed for the max - bisection problem , and the convergent result was given
本文首先介紹了半定規(guī)劃的基本知識(shí),包括半定規(guī)劃的理論、算法、應(yīng)用和研究現(xiàn)狀,然后在半定規(guī)劃的算法和應(yīng)用方面做了一些工作,具體如下： 1 .對(duì)圖的最大二等分問(wèn)題提出一種非線(xiàn)性規(guī)劃算法,并給出該算法的收斂性證明
According to new principles , the method of surface fairness and the character of surface based on direct on initial data point are researched , new curve and surface fairness optimization modeling fitting with fea are produced . 3 . evolutionary programming algorithm is presented to solve the optimization modeling
( 3 )在基于點(diǎn)的曲線(xiàn)曲面的表達(dá)方法下，結(jié)合曲線(xiàn)曲面的特點(diǎn)與光順處理的具體要求，采用一種新的現(xiàn)代優(yōu)化技術(shù)? ?進(jìn)化規(guī)劃算法的思路與方法，對(duì)問(wèn)題進(jìn)行求解。
A new evolution optimization - - - evolutionary programming algorithm is presented to solve the optimization modeling on curve and surface fairness . the following is a simple introduction to the thesis " s main content : 1 . according to finite element analysis , new surface fairness principles based on the method of surface reconstruction direct on initial data point are produced
論文分析了當(dāng)前曲線(xiàn)曲面光順的主要問(wèn)題，采用基于點(diǎn)的曲線(xiàn)曲面表達(dá)方式，針對(duì)有限元技術(shù)對(duì)曲線(xiàn)曲面的要求，提出針對(duì)有限元技術(shù)的曲線(xiàn)曲面光順準(zhǔn)則，根據(jù)這個(gè)準(zhǔn)則建立了相關(guān)的光順模型，并找出一種新的優(yōu)化算法求解這個(gè)問(wèn)題。

更多例句： 1 2 3 4 5

推薦英語(yǔ)閱讀

programming algorithm的中文翻譯，programming algorithm是什么意思，怎么用漢語(yǔ)翻譯programming algorithm，programming algorithm的中文意思，programming algorithm的中文，programming algorithm in Chinese，programming algorithm的中文，programming algorithm怎么讀，發(fā)音，例句，用法和解釋由查查在線(xiàn)詞典提供，版權(quán)所有違者必究。