6105 search results - page 439 / 1221 » A Parallel Algorithm for Bound-Smoothing |
153
click to vote
COR
2010
15 years 7 months ago
2010
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
191
click to vote
CPHYSICS
2010
15 years 7 months ago
2010
In this paper, a programming model is presented which enables scalable parallel performance on multi-core shared memory architectures. The model has been developed for application...
136
click to vote
ICIP
2009
IEEE
16 years 8 months ago
2009
IEEE
Enabling parallel processing is becoming increasingly necessary for video decoding as performance requirements continue to rise due to growing resolution and frame rate demands. I...
192
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
k-mutual exclusion is an important problem for resourceintensive peer-to-peer applications ranging from aggregation to file downloads. In order to be practically useful, k-mutual...
214
click to vote
ICDCS
2008
IEEE
16 years 1 months ago
2008
IEEE
— Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of distributed algorithms for constructing a small CDS in wireless ad hoc ...