Sentence examples for decrease solving from inspiring English sources
Future research on this paper could have two directions; one direction is to develop a heuristic algorithm to find initial feasible solution to speed up convergence, and the other direction is to use a hybrid genetic algorithm and ant colony optimization to enable the algorithm for solving more large-scale problems and decrease solving time of algorithm.
Given that conflict detection should be less efficient for young adolescents, we predict that any possible confidence decrease after solving conflict problems with adults or late adolescents should be absent (or less clear at least) in early adolescents.
Incorporating optimization in the simulation algorithm decreases the solving time and brings faster convergence of the objective values.
Thereby, the APSO, by adjusting real values to integers, may not be the best choice, as its performance was decreased to solve such a complex problem.
The direct effect of math-science coherence to problem solving decreased and thus indicated that confounding was present (MacKinnon et al. [2000]).
They proposed a two stage binary integer programming and two efficient heuristics, best fit butterfly (BBF) and best fit decreasing (DBF), for solving large scale problems.
Therefore, the decreased confidence after solving conflict problems should be far less pronounced for early than for late adolescents.
23 Provision of support for the emotional demands of parenting while sleep deprived, guidance on reasonable expectations of maternal and infant sleep in the early postpartum, and support in problem solving could decrease negative appraisal of sleep loss and maximise opportunity for sleep.
It is hypothesized that the problem solving training decreases the NPO.
This orders-of-magnitude decrease in computation time for solving systems of realistic kinetic networks implies that important coupled, multiphysics problems in various scientific and technical fields that were intractable, or could be simulated only with highly schematic kinetic networks, are now computationally feasible.
The use of incremental approach decreased the computational complexity of solving the system of equations within each greedy algorithm's iteration from O(n3) to O(n2).
