game tree 中文意思是什麼

game tree 解釋
博弈樹
  • game : n 1 游戲;娛樂;戲謔;運動。2 (運動、棋類等的)比賽,競賽;(比賽中的)一盤,一場,一局;勝利;...
  • tree : n 特里〈姓氏〉。n 1 樹〈主要指喬木,也可指較大的灌木〉。 ★玫瑰可以稱為 bush 也可以稱為 tree 2 木...
  1. 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

    以五子棋為例,提出了用遺傳演算法代替搜索樹法解決博弈問題的基本方案,並對適應度函數的設計作了一些有益地探索,給出了設計適應度函數應滿足的必要條件。
  2. This makes prbfm a promising emerging game - tree search algorithm in future chip multiprocessor platforms

    這使得prbfm成為將來多核處理器( cmp )多線程游戲樹搜索benchmark的一個有力的備選演算法。
  3. Game - tree search plays an important role in the field of artificial intelligence. in this paper we characterize and compare two parallel game - tree search workloads in chess on two intel xeon

    游戲樹搜索( game - treesearch )一直以來在人工智慧領域扮演著極其重要的角色,并行游戲樹搜索更是該領域的熱點研究問題。
  4. Search tree, which is restricted by search depth, is the traditional algorithm in dealing with game

    摘要解決博弈問題的傳統演算法搜索樹法所無法克服的對搜索深度的限制。
  5. The experimentation proves that the game procedure designed by genetic algorithm outweighs that designed by search tree

    實驗表明,用遺傳演算法所設計的對弈程序優于搜索樹法。
  6. Over there, under a huge pine tree, an interesting game of chess were going on between two old men, with fans in their hands each

    在那邊一棵大松樹下,兩位老人進行著一場有趣的棋賽,每位都扇著扇子。
  7. This paper studies the relaxed game chromatic number of partial k - tree with the relaxed degree d

    本文主要研究的是偏k -樹在鬆弛度為d的情況下的鬆弛競賽色數問題。
  8. The relaxed game chromatic number of tree, outerplanar graphs, partial k - tree and pseudo partial k - tree have been studied by many researchers home and abroad, this paper further studied the relaxed game chromatic number of partial k - tree based on the known research, according to appling a new activation strategy, we proved if the relaxed degree d > 2k + 1, then for this ( r, d ) - relaxed coloring game, we have ( 2k + 1 ) - xg ( g ) < k + 1, it is an improvement about the result in paper [ 2 ]

    對樹,外平面圖,偏k -樹及偽偏k -樹的鬆弛競賽染色已在不同程度上得到了一些研究,並取得了一些相應的結果。本文正是在已有研究的基礎上,對偏k -樹的鬆弛競賽色數進行了進一步的研究,使得在鬆弛度d不小於2k + 1的情況下,對這個( r , d ) -鬆弛競賽染色,有,它是文章[ 2 ]中結果的一個很好的改進。
  9. Showed his first game against the pacers, the stephon marbury crossover that caused yao to fall like a tall oak tree ( with amare laughing on the bench ) and the home opener, all of which were not good performances by any means

    放了他第一場比賽對步行者的鏡頭,馬布里過人,並且讓姚明就像一個大橡樹一樣倒在地板上(阿邁爾在板凳上笑) ,然後是主場亮相,所有這些時候的表現一點都不能說好。
  10. Nowadays, concerning the relaxed game chromatic number of tree, out - erplanar and partial k - tree graph have been studied by many researchers home and abroad, this paper studies further the relaxed game chromatic number of trees

    如今,關于樹,外平面圖及偏k -樹的鬆弛競賽染色已引起眾多學者的研究,本文主要研究森林的鬆弛競賽色數。
  11. The more work was to study learning and rule discovery theory of agent by applying the improved michigan method, and to analyze the method of agents how to gain the knowledge belief in the multi - agent environment in virtue of the multi - person game theory, as well as study the game tree structure of the agent ' s belief - desire - intention ( bdi ) model and agent how to decide

    應用改進的密歇根法研究了主體的學習和規則發現的理論與應用,同時藉助多人博弈結構理論,分析了主體在多主體環境下知識信念的獲取方法,以及主體bdi模型的博弈樹結構和主體決策機制。
分享友人