search problem 中文意思是什麼

search problem 解釋
探索問題
  • search : vt 1 搜查；檢查（身體、衣袋等）；搜索，搜尋；找；尋找。2 調查；查究；探求；追求；根究 （into）。3...
  • problem : n. 1. 問題，課題；疑難問題；令人困惑的情況。2. 【數、物】習題；作圖題。3. （象棋的）布局問題。adj. 1. 成問題的；難處理的。2. 關于社會問題的。
  1. Motivated by this observation, this paper studies the problem of efficiently processing k nn k - ge 1 search on r - tree - like structures storing historical information about moving object trajectories. two algorithms are developed based on best - first traversal paradigm, called bfp k nn and bft k nn, which handle the k nn retrieval with respect to the static query point and the moving query trajectory, respectively. both algorithms minimize the number of node access, that is, they perform a single access only to those qualifying nodes that may contain the final result

    例如，若已知動物的軌跡，則動物學家可能提出如下兩種查詢： i在時間區間ti ， tj內找到離一個給定的靜態點譬如食物源實驗室等最近的k條動物軌跡ii在時間區間ti ， tj內找到離一條預先指定的動物軌跡最近的k條動物軌跡。
  2. In accordance with the problem that the fcm algorithm is quite time - consuming for search out cluster cancroids and may not be suitable for on - line modeling and control. this dissertation proposed an improved fuzzy identification method based multistage random sampling fuzzy c - means clustering algorithm ( mrfcm ). it has higher approximate precision and the cpu time has slowed down sharply compared with the common fuzzy

    Johnyen和liangwang介紹了幾種應用於模糊模型的信息優化準則，本論文在此基礎上對統計信息準則進行一些改進，並與快速模糊聚類和正交最小二乘方法結合，提高了模型的辨識精度和泛化能力。
  3. The capacitated open vehicle routing problem and its tabu search algorithm

    帶裝載能力約束的開放式車輛路徑問題及其禁忌搜索演算法研究
  4. A tabu search algorithm for the capacitated open vehicle routing problem is proposed

    提出了一種用於求解帶裝載能力約束的開放式車輛路徑問題的禁忌搜索演算法。
  5. Purpose show concern for child prostitutes who seek aids and counsel them as they cerate a new life ; establish a half - way home and carry our education for the whole person ; assist females in adverse situation by providing emergency shelter ; arouse the public [ & - ( ] s concern in joining a common effort to reconstruct society ; researcg the problem of child prositutes and search for ways to solve the problem

    成立主旨關懷雛妓救援，輔導開創新生；設立中途之家，進行全人教育；協助不幸女性，提供緊急庇護；喚起大眾關懷，協力重建社會；研究雛妓問題，尋求防治之道本著耶穌基督博愛精神，關心兒童、少年、家庭及社會教育問題，從事不幸兒童、少年、婦女及其家庭救助與重建工作。
  6. Crossover tabu search for traveling salesman problem

    一種求解旅行商問題的交叉禁忌搜索
  7. Taking gobang as an example, this paper proposes the base scheme for solve game problem by adopting the notion of genetic algorithms instead of search tree, and makes some exploratory work on the design of fitness function, it also provides with requirements for designing fitness function

    以五子棋為例，提出了用遺傳演算法代替搜索樹法解決博弈問題的基本方案，並對適應度函數的設計作了一些有益地探索，給出了設計適應度函數應滿足的必要條件。
  8. It ’ s complicated to search proper commodities because of the inorganization of large number of commodities in the internet. and the problem that one commodity held by different people can has different titles makes it harder to search

    網路中海量的商品信息的無組織化使得商品的搜索變的復雜，而且同一商品的不同名稱也給商品搜索帶來了很多的不便。
  9. Document similarity search is to find documents similar to a given query document and return a ranked list of similar documents to users, which is widely used in many text and web systems, such as digital library, search engine, etc. traditional retrieval models, including the okapi s bm25 model and the smart s vector space model with length normalization, could handle this problem to some extent by taking the query document as a long query

    文檔相似搜索指從文檔集中檢索與給定查詢文檔相似的文檔。對于給定的查詢文檔，我們期望文檔相似搜索系統能夠返回一個按相似度排序的相似文檔列表。文檔相似搜索技術已經被廣泛應用到電子圖書館，搜索引擎等系統中，例如citeseer . ist科學文獻數字圖書館的相似文獻推薦功能， google的相似網頁查詢功能等。
  10. Half the problem for internet search engines is

    網際網路搜索引擎有一半的問題在於
  11. Tabu search technique for solving the routing problem

    禁忌搜索演算法用於解決網路路由問題
  12. Heuristics algorithm for knapsack problem based on the tabu search

    基於禁忌搜索的啟發式求解背包問題演算法
  13. Simulated annealing algorithm is a kind of heuristic monte carlo method. in the course of solve the optimum problem, it conquer the blindfold searching mechanism of normal monte carlo method, and based on a appointed theory to guides search, so it can ensure a successful search

    模擬退火方法是一種啟發式蒙特卡羅法，在解決優化的問題中，它克服了常規蒙特卡羅方法盲目的隨機搜索機制，而是在一定的理論指導下搜索，故能保證搜索成功。
  14. For the sake of solving the search problem in community, we propose a search algorithm based on dominating set, combining category to organize lots of commodities, dividing commodities into different communities. the algorithm uses backbone network created by dominating set, combining informed k - walker search algorithm, to search commodity in community, which is proved to be more efficient

    同時，為了解決社區內搜索的問題，本文提出一種基於支配集的搜索演算法，結合分類樹組織海量的商品信息，將商品信息劃分到不同的社區中的方法，利用支配集形成的骨幹網，結合基於提醒的k - walker搜索策略，在社區內進行商品信息搜索，獲得了很好的效果。
  15. In particular, we give the method to compute the initial probability distribution of target ’ s location and the form of detection function. thus we formulate the original problem as an optimal search problem

    本文給出了對目標初始概率分佈函數和探測函數的具體形式，並且將三維模型檢索問題轉化為最優搜索問題。
  16. We can use optimal search theory to solve this problem. optimal search theory is a subject developed during the world wide war ii. the optimal search problem involves computing how resources can be allocated so as to maximize the probability of detection, or to minimize the comsumption of resources used

    最優搜索理論是二戰期間發展起來的一門學科，最優搜索理論要解決的核心問題就是在總搜索資源有限的情況下，如何分配搜索資源使得成功搜索到目標的可能性最大或花費的搜索代價最小。
  17. Thirdly, give the analysis of the current status of the lack of data in the space debris environment modeling aera, and propose the plan to carry on the search of the modeling data, and use the genetic algorithms to solve the search problem

    接下來闡述了對空間碎片軌道參數分佈進行研究的原理，此原理轉化為求解優化問題的數學模型，提出採用遺傳演算法解決優化問題。 （ 4 ）進一步講述利用遺傳演算法和編制模式實現求解的過程。
  18. Bf : web services discovery and composition as graph search problem. in proc. the 2005 ieee international conference on e - technology, e - commerce and e - service, hong kong, 2005, pp. 784 - 786

    3基於上述技術，我們實現了服務組合和檢索引擎atc ，提供服務組合和對top k的組合服務實現檢索的任務。
  19. Hierarchy theory is introduced to interactive evolutionary computation and hierarchical interactive evolutionary computation is put forth aiming at inefficient local search problem of the existing interactive evolutionary computation

    摘要針對目前互動式進化計算存在的局部搜索能力不強、效率低下等問題，將分層的思想引入互動式進化計算，提出了分層互動式進化計算。
  20. The purpose of fractal image compression is to gain a good ifs whose attractor is similar to original image. so this search problem can be viewed as a combination and optimization process with complicated constraints and a large searching space

    分形圖像壓縮的最終目的是要獲得一個較好的ifs ，使它的吸引子與原始圖像盡可能的相似，可以把這個搜索問題看成是一個優化過程。
分享友人
分享到 Line

分享到臉書