Sentence examples for tasks to maximize from inspiring English sources

In this phase, the proposed heuristic algorithm assigns the tasks to maximize the energy-balancing considering the energy harvesting characteristics.

In this paper, we study how to schedule customers' tasks to maximize the total profit of a Hadoop cluster.

They proposed a tool based on integer linear programming to explore the micro-architectures and allocate application tasks to maximize throughput.

Processors give up raw computational capacity for the ability to support large and irregular computations robustly, while FPGAs give up the ability to switch rapidly among diverse tasks to maximize available compute density and spatial parallelism.

They take advantage that they are the ones that are planning, and usually can overstate workload and number of days, when in fact the workload cannot take that much [time]." Another NGO official in Malawi noted that people might split up tasks to maximize per diems: for example, a supervisor may visit the same place four separate times when she could have done all the activities in one trip.

Start by choosing whether you're going for Magic Dart Do Slayer Tasks to maximize the money go for part 2. Part 1 Magic Dart: For this you absolutely have to have Smoking Kills done and it would be very much preferred if you had Shilo Village done, 50+ Slayer, and 100+ combat so you could get tasks from Duradel.

Coils simulation and design is a fundamental task to maximize Signal-to-Noise Ratio in Magnetic Resonance applications.

Dynamic solutions based on task migration has been recently explored to perform run-time reallocation of task to maximize performance and optimize energy consumption.

Although transplacental pharmacotherapy has been available, it is a challenging task to maximize fetal drug exposure, while minimizing drug exposure of the mother.

Seeing MTO as the task to maximize the number of satisfied pairs, Medvedovsky et al. also provided polynomial-time approximation algorithms with approximation factor 1 /4 in the case of stars and O(1 /log n) in the case of general n-vertex trees.

The goal in this problem is to minimize makespan (i.e., the time when the latest machine finishes its assigned tasks) and to maximize the robustness of the schedule (i.e., its tolerance to unexpected changes on the estimated time to complete the tasks).