Attribute reduction in rough set theory is a NP-hard problem, which is studied mainly to design a more efficient algorithm.
粗糙集的属性约简是一个NP难问题,获得较为高效的算法是研究的主要目的。
Based on the homotopy idea, an improved homotopy algorithm was proposed in order to search a more efficient algorithm for nonlinear least squares adjustment.
为了寻求一种更有效的非线性最小二乘平差算法,根据同伦思想提出了一种改进的同伦算法。
This algorithm tends to be memory efficient (allocating what's necessary) but requires more time to manage the heap.
这种算法通常具有较高的内存使用效率(分配需要的内存),但是却需要花费更多时间来对堆进行管理。
Where those pieces, I would do the same thing with, I would divide them up into smaller chunks, and sort those. Is that going to give me a more efficient algorithm?
合并起来,而那些小列表,我又会把他们拆成更小的列表,再排序,这会给我,一个更高效的算法么?
应用推荐