Sciweavers

HPCC
2009
Springer
13 years 9 months ago
Load Scheduling Strategies for Parallel DNA Sequencing Applications
This paper studies a load scheduling strategy with nearoptimal processing time leveraging the computational characteristics of parallel DNA sequence alignment algorithms, specific...
Sudha Gunturu, Xiaolin Li, Laurence Tianruo Yang
COCOON
2005
Springer
13 years 9 months ago
On-Line Simultaneous Maximization of the Size and the Weight for Degradable Intervals Schedules
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...
ISCAS
2005
IEEE
126views Hardware» more  ISCAS 2005»
13 years 10 months ago
Scheduling algorithm for partially parallel architecture of LDPC decoder by matrix permutation
— 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 ...
In-Cheol Park, Se-Hyeon Kang
WADS
2007
Springer
131views Algorithms» more  WADS 2007»
13 years 10 months ago
On the Robustness of Graham's Algorithm for Online Scheduling
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’...
Michael Gatto, Peter Widmayer
IBPRIA
2007
Springer
13 years 10 months ago
Haar Wavelets and Edge Orientation Histograms for On-Board Pedestrian Detection
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 ...
David Gerónimo, Antonio M. López, Da...
ICRA
2008
IEEE
205views Robotics» more  ICRA 2008»
13 years 10 months ago
Minimum time point assignment for coverage by two constrained robots
— 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
STACS
2009
Springer
13 years 11 months ago
Semi-Online Preemptive Scheduling: One Algorithm for All Variants
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...
Tomás Ebenlendr, Jiri Sgall