-->
当前位置:首页 > 题库

题库 第6567页

  • 最新
  • 浏览
  • 评论

Random restarts can help a local search algorithm to better find

Luz5年前 (2021-05-10)1397
Random restarts can help a local search algorithm to better find global maxima that are surrounded by local maxima.~@[](…

In a Turnpike Reconstruction Problem, given distance set D = { 2

Luz5年前 (2021-05-10)1648
In a Turnpike Reconstruction Problem, given distance set D = { 2, 2, 4, 6, 6, 8 }, x1~x4 = ( 0, 2, 6, 8 ) is the only so…

In a Turnpike Reconstruction Problem, given distance set D = { 2

Luz5年前 (2021-05-10)1537
In a Turnpike Reconstruction Problem, given distance set D = { 2, 2, 4, 4, 6, 8 }, x1~x4 = ( 0, 2, 4, 8 ) is the only so…

In general, for a 3-way merge we need 6 input buffers and 2 outp

Luz5年前 (2021-05-10)1932
In general, for a 3-way merge we need 6 input buffers and 2 output buffers for parallel operations.~@[](2)答案:TRUE…

Amortized bounds are weaker than the corresponding worst-case bo

Luz5年前 (2021-05-10)1102
Amortized bounds are weaker than the corresponding worst-case bounds, because there is no guarantee for any single opera…

Average-case bounds are stronger than the equivalent amortized b

Luz5年前 (2021-05-10)1010
Average-case bounds are stronger than the equivalent amortized bounds, because there is a guarantee for any single opera…

If a leftist heap can be implemented recursively, so can its cou

Luz5年前 (2021-05-10)1252
If a leftist heap can be implemented recursively, so can its counterpart skew heap.~@[](2)答案:FALSE…

When a leftist heap can be implemented recursively, its counterp

Luz5年前 (2021-05-10)1078
When a leftist heap can be implemented recursively, its counterpart skew heap may not be.~@[](2)答案:TRUE…

For the document-partitioned strategy in distributed indexing, e

Luz5年前 (2021-05-10)1255
For the document-partitioned strategy in distributed indexing, each node contains a subset of all documents that have a…

The following binary search tree is a valid red-black tree.

Luz5年前 (2021-05-10)1135
The following binary search tree is a valid red-black tree.
The following binary search tree is a valid red-black tree. ![br-tree.png](~/8b3f6083-11d6-490f-b7fc-5b180064c3ae.png)…