Sciweavers

1389 search results - page 166 / 278
» Parallel Algorithms for Treewidth Two
Sort
View
CCGRID
2005
IEEE
15 years 3 months ago
Task scheduling strategies for workflow-based applications in grids
Grid applications require allocating a large number of heterogeneous tasks to distributed resources. A good allocation is critical for efficient execution. However, many existing ...
James Blythe, S. Jain, Ewa Deelman, Yolanda Gil, K...
HICSS
2003
IEEE
200views Biometrics» more  HICSS 2003»
15 years 3 months ago
A Dynamic Assignment Problem in a Mobile System with Limited Bandwidth
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
Yang Wang 0006, Thomas Kunz
HIPC
2003
Springer
15 years 3 months ago
Combined Scheduling of Hard and Soft Real-Time Tasks in Multiprocessor Systems
Many complex real-time applications involve combined scheduling of hard and soft real-time tasks. In this paper, we propose a combined scheduling algorithm, called Emergency Algori...
Basheer Al-Duwairi, Govindarasu Manimaran
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
14 years 11 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki
ICPR
2008
IEEE
15 years 11 months ago
Automatic bi-layer video segmentation based on sensor fusion
We propose a new solution to the problem of bilayer video segmentation in terms of both, hardware design and algorithmic solution. At the data acquisition stage, we combine color ...
Pierre Boulanger, Qiong Wu, Walter F. Bischof