你即將離開本站

並前往https://hal.archives-ouvertes.fr/hal-01499672

Upper confidence bound for rooted directed acyclic graphs

We call this framework Upper Confidence bound for Direct acyclic graphs (UCD) as it constitutes an extension of Upper Confidence bound for Trees (UCT) for ...

確定！ 回上一頁

查詢 「Acyclic」的人也找了：

  1. acyclic中文
    2.
  2. acyclic化學
    3.
  3. Acyclic
    4.
  4. Topological sort
    5.
  5. Directed acyclic Graph
    6.
  6. directed acyclic graph中文
    7.
  7. acyclic compound中文
    8.
  8. dag演算法
    9.