您要查找的是不是:
- The gridding arithmetic of search tree of robotic path is derived. 同時(shí),還推導了機器人路徑搜索樹(shù)網(wǎng)格算法。
- Sergey Drakunov, Umit Ozguner, P. Dix and B. Ashrafi, “ABS Control Using Optimum Search via Sliding Modes”, IEEE Trans. On Control Systems Tech., Vol.3, No.1, March 1994. 吳孟宗;無(wú)人飛行載具防鎖死煞車(chē)系統之研究;逢甲大學(xué)自動(dòng)控制工程研究所碩士論文;2001.
- Generalized Search Trees for Database Systems. 數據庫普通查詢(xún)樹(shù)。
- Some limit laws for the branches and subtrees in a random recursive tree and binary search tree are established in this dissertation. 本文主要研究隨機遞歸樹(shù)和隨機二叉搜索樹(shù)上與分支和子樹(shù)相關(guān)的極限定理。
- The experimentation proves that the game procedure designed by genetic algorithm outweighs that designed by search tree. 實(shí)驗表明,用遺傳算法所設計的對弈程序優(yōu)于搜索樹(shù)法。
- In this paper, we put forward a region representation data structure-digital search tree(DST) and its lineal encoding (LDST). 一、引言 區城表示在圖象處理、計算機圖形學(xué)、景物分析中有重要的應用。
- This chapter will introduce a balanced AVL search tree, to discuss its information structure, function, and design program to use it. 本章將介紹平衡的 AVL 搜尋樹(shù),討論它的資料結構、函式,并設計程式使用它。
- Using a binary search tree or dividing the string into segments as long as the square root of the length of the string will solve the problem. 用一個(gè)二叉搜索樹(shù)或者將串切分成長(cháng)度的平方根那么長(cháng)的小段都可以解決這個(gè)問(wèn)題。
- An improved heuristic method for Optimum searching of mixed discrete variable problems, i. e. a mixed discrete expanded complex programming method(MDECP)is presented. 目前,本文基于現有混合離散變量?jì)?yōu)化方法的基本思想,提出了一種改進(jìn)的混合離散變量問(wèn)題的試探性尋優(yōu)方法,即MDECP法。 該法首先對文獻[2]的“有效函數”定義作了一定的改進(jìn),即進(jìn)行了規一化處理和對等式約束問(wèn)題建立了“緩沖區”;
- A Simple Method of Global Optimum Search in Design 優(yōu)化設計中的全域最優(yōu)簡(jiǎn)易搜索法
- Simple Binary Tree Class - Binary Search Trees are useful for finding items in a list that changes infrequently. 二叉搜索樹(shù)在查找經(jīng)常變化的列表時(shí)是很非常有用的。
- For regular simple Backward Search Alg-orithm (Algorithm SB), Cs, the expected branch number of the vertices on its Backward Search Tree, is equal to the average of the average outdegree of the useful vertices on the present graph of each level. 對于常規的簡(jiǎn)單 回溯法SB,回溯樹(shù)上各頂點(diǎn)的期望分枝數cs等于各層當前可用頂點(diǎn)的平均出度的 平均值。
- In the"Wizard"diagnosis, we made use of the precise mode to diagnosis of the crops disease. Using knowledge of the search tree, we speculate a series of symptoms of the disease specific to the ultimate reason. 在“向導式”診斷中,在精確推理模式下對農作物進(jìn)行了病害的診斷分析,利用知識搜索樹(shù)實(shí)現了對病害一系列癥狀到最終具體病癥的前向推理。
- The incremental rules extraction is a focus problem of KDD.A novel rules extraction algorithm which is called "RDBRST" (Rule Derivation Based on Rough set and Search Tree) was proposed. 摘要基于粗糙集理論提出了一種新的規則提取算法:基于粗糙集和搜索樹(shù)的規則提取算法。
- The market offer optimum condition for sale. 市場(chǎng)為銷(xiāo)售提供了最佳條件。
- As the car hit the tree he was snot out. 汽車(chē)扭在村上,他被猛地摔了出來(lái)。
- Most favorable or desirable; optimum. 最理想的最適宜的,最令人滿(mǎn)意的,最優(yōu)的
- The bird sang high and clearly in the tree. 鳥(niǎo)兒在樹(shù)上清脆地高歌。
- Rapid Coherent Acquisition for PN Sequence Using Optimum Search Algorithm 使用試錯法加快擴頻通信偽隨機碼捕獲
- The annular markings on a tree indicate its age. 樹(shù)的環(huán)形紋理顯示其年齡。