Sentence examples for method by reducing from inspiring English sources

We now extend the ϵ-constraint method by reducing an uncertain multiobjective linear programming problem to a single objective uncertain linear programming problem.

The experiments on the Aurora2 database proved the effectiveness of the proposed method by reducing relative errors by over the mel-cepstral-based features and by over the conventional histogram equalization method, respectively.

This method is able to outperform the standard method by reducing the SD of the H s estimate error and increasing the correlation coefficient of the H s time series, while maintaining a negligible estimate error bias.

Importantly, we develop a technique to greatly improve the efficiency of the proposed method by reducing the number of constraints and variables in the integer linear programming problem under consideration.

In addition to automation, the developed sequential injection analysis method greatly improves the standard off-line oxalate complexation and alkalimetric titration method by reducing thousand fold the required sample volume, forty times the nuclear waste per analysis as well as the analysis time by eight fold.

Three kinds of silver nanostructures – nanowires, nanocubes and bipyramids – were synthesized via a simple solvothermal method by reducing silver nitrate with ethylene glycol using poly vinylpyrrolidone) as an adsorption agent and adding different concentrations of sodium chloride (NaCl) into the solution.

The approach identified the optimal solution about 40 times faster than any of the other methods by reducing the number of time consuming flow and transport model evaluations.

Performance results demonstrate that ICP significantly outperforms existing clustering methods by reducing up to 55% time consumption and 89% amount of transmissions for energy-saving.

In general terms, it was demonstrated that the BPF outperforms the APF, GPF, and the PBPF methods by reducing the computational time to find the optimal path at least by a factor of 1.59.

Both methods utilize the transverse update technique developed in the 2D USM algorithm to account for transverse fluxes without solving intermediate Riemann problems, which in turn gives cost-effective 3D methods by reducing the total number of Riemann solves.

The results also show that the proposed methods for ToR selection and wavelength selection in optical data centers outperform other methods by reducing the rejection ratio by up to 47% with dynamic reconfiguration of lightpaths and 40% with incremental configuration of lightpaths.