Parallel machine scheduling with uncertain communication delays

In this paper, a novel approach based on a variant of deep Fully Convolutional Network (FCN) with dilated convolutions was presented for handwritten text line seg- mentation..

In this preliminary work, we focus on the computation of a single answer set and we investigate two directions: first, we act on the evaluation of the heuristically best literal,

We have compared and tested some of the existing options for different LDS components, such as discrepancy counting modes and branching structures, to solve the parallel

This algorithm was extended to get approximation algorithms for the L max criteria with various hypothe- sis: parallel processors (Hanen and Zinder 2009), preemptive jobs (Hanen

We will now compare ASAP with the schedule Round-Robin, formally defined as follows: under Round-Robin the task i is sent to the processor i mod m as soon as possible, while

Under the one-port model, with a uniform communi- cation time for all tasks and processors, the optimal policy of the master consists in sending the tasks as soon as they arrive..

For small instances, a benchmark data from the literature is used to compare the performance of the meta-heuristics versus the optimal solution found by the LP approach, based on the

Dans notre série, les résultats des enfants sourds pré-linguaux implantés avant 3 ans étaient meilleurs à 1 an que ceux opérés plus tardivement.. Les