Sentence examples for by a greedy algorithm from inspiring English sources

The proposed cooperative forwarding is modeled as a 0−1 knapsack problem and solved by a greedy algorithm.

The length of the signaling pathway generated by a greedy algorithm between two nodes exhibited polylogarithmic behavior when the grid distance between the nodes was less than m, the maximal length of a long-range connection for that network.

Individuals behavior is modeled by a greedy algorithm that, given a source and destination, forwards a message to the neighbor of the current holder, which is the closest to the destination.

The phonetic content of these sentences is optimized by a greedy algorithm that maximizes statistical coverage of triphones in the target language (differentiated also with respect to syllabic and word boundaries).

The PEGASIS (Power-Efficient GAthering in Sensor Information Systems) protocol [13] proposed by Lindsey etc. makes a chain which has a minimum sum of the length with all the nodes in WSN by a greedy algorithm.

The graph partition problem can be solved by a greedy algorithm, which repeatedly checks all out-going (in-coming) edges of each vertex.

Further improvements to time complexity were proposed by Williams et al. [9], by using a greedy algorithm while incorporating a simple curvature approximation.

For instance, 6 = 5 + 1 only (we don't allow 3 + 2 + 1 or 3 + 3), and 20 = 13 + 5 + 2. Given any n, it's not difficult to find the appropriate breakdown, by using a greedy algorithm: first peel off the largest possible Fibonacci number as one summand, and repeat for what remains, until you are left with the smallest Fibonacci component.

In this work a starting solution for this problem is found by using a greedy algorithm.

For example, in [10], the authors design a channel-opportunistic framework with the purpose of enhancing network throughput under delay constraints, which is implemented by designing a greedy algorithm.

For example, the authors in [10] introduce a cellular downlink throughput optimization problem under delay constraints, which is solved by designing a greedy algorithm since it is NP-hard problem.