Sciweavers

1185 search results - page 91 / 237
» An Improved Parallel Thinning Algorithm
Sort
View
ESWA
2008
162views more  ESWA 2008»
14 years 10 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
FTTCS
2006
132views more  FTTCS 2006»
14 years 9 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
CLOUDCOM
2010
Springer
14 years 7 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Di-Wei Huang, Jimmy Lin
SPAA
1994
ACM
15 years 1 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
IEEEPACT
2009
IEEE
15 years 4 months ago
Soft-OLP: Improving Hardware Cache Performance through Software-Controlled Object-Level Partitioning
—Performance degradation of memory-intensive programs caused by the LRU policy’s inability to handle weaklocality data accesses in the last level cache is increasingly serious ...
Qingda Lu, Jiang Lin, Xiaoning Ding, Zhao Zhang, X...