Sentence examples for different variants of the problem from inspiring English sources

Different variants of the problem are investigated, including uniqueness requirements and reserve routes.

Findings of this study reveal that the proposed algorithms can be applied to different variants of the problem and generate significantly better results.

Applied to the problem of joint source-channel optimization, various techniques like concatenated coding [22, 23], dynamic programming [23 25], exhaustive search [22], and gradient-based optimization [26, 27] are employed to solve different variants of the problem.

We consider all the different variants of the problem that have been proposed in the literature and we perform a comprehensive experimental analysis on all the available public instances.

Biological network alignment methods are usually designed specific to different variants of the problem.

In recent years, several algorithms have been suggested for different variants of this problem, including the Steiner tree based methods of [ 1, 2], the flow based approach of [ 3] and the anchored reconstruction method of [ 4].

We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated vehicle routing problem (CVRP), the multi-depot vehicle routing problem (MDVRP), the site-dependent vehicle routing problem (SDVRP) and the open vehicle routing problem (OVRP).

The proposed models are evaluated on different variants of the Jeffery–Hamel problem by varying the Reynolds number, angles of the walls and the Hartmann number.

In this paper, we deal with two different variants of the Critical Node Problem, designing a flexible genetic algorithm for tackling them both.

SMILE [ 32] is a family of algorithms designed to solve slightly different variants of the structured motif discovery problem on set of input sequences.

Each of these has been produced by hand, by some of the cleverest people on the planet and yet each can be thought of as a single point in a Pareto trade-off space in which speed, accuracy, memory requirements, etc., are balanced on different variants of the approximate string matching problem.