Sentence examples for improve the complexity from inspiring English sources
In addition, they can improve the complexity of A* exponentially and often dominate both A* and blind BDD-based search by several orders of magnitude.
A variety of strategies are currently under investigation to develop further the display capabilities of AcMNPV and to improve the complexity of library that might be accommodated.
A number of strategies are being investigated in order to further develop the display capabilities of AcMNPV and improve the complexity of a library that may be accommodated.
Open until now has been the question of whether working with restricted classes of programs can improve the complexity of aliased register allocation with alignment restrictions.
We also highlighted the management practices to improve the complexity of vegetation in commercial tree stands should be taken cautiously, insofar as reduced productivity per area entails a greater demand for land.
Because our algorithm relies on the computation of the optimal schedule in the ideal model (K="∞), in order to achieve O(n2) complexity, we improve the complexity of computing the optimal schedule in the ideal model for aligned jobs from the currently best known O(n2logn) to O(n2).
The use of the parallel architecture in the classification domain is introduced in order to improve the complexities of the corresponding algorithms, so that they will be considered as a pre-processing procedure.
For radix-2 (meaning the input is split twice, and those signals are split twice, and so on), this algorithm lowers the number of complex multiplications to (N/2)log2N complex multiplications and Nlog2N complex additions, effectively improving the complexity from O N2) to O(NlogN).
Our algorithm improves the complexity of the currently best known algorithms in terms of the number of transmissions for each query.
This paper also improves the complexity of the maximum clique, the maximum independent set, the chromatic number and the maximum clique cover problems by giving efficient algorithms, thanks to the decomposition tree.
Using self-regular proximity functions instead of a classical logarithmic barrier function, Peng et al. [3 5] improved the complexity of large-update IPMs for the LO problem, the SDO problem, and the SOCO problem.
