This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
Fabien Baille, Evripidis Bampis, Christian Lafores...
— The fully parallel LDPC decoding architecture can achieve high decoding throughput, but it suffers from large hardware complexity caused by a large set of processing units and ...
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
On–board pedestrian detection is a key task in advanced driver assistance systems. It involves dealing with aspect–changing objects in cluttered environments, and working in a ...
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...