282 search results - page 53 / 57 » Efficient bundle sorting |
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
DAC
2002
ACM
14 years 7 months ago
2002
ACM
Increasing non-recurring engineering (NRE) and mask costs are making it harder to turn to hardwired Application Specific Integrated Circuit (ASIC) solutions for high performance a...
CHI
2007
ACM
14 years 7 months ago
2007
ACM
On traditional tables, people frequently use the third dimension to pile, sort and store objects. However, while effective and informative for organization, this use of the third ...
IPPS
1999
IEEE
13 years 11 months ago
1999
IEEE
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
ICALP
1993
Springer
13 years 10 months ago
1993
Springer
The divide-and-conquer principle is a majoi paradigm of algorithms design. Corresponding cost functions satisfy recurrences that directly reflect the decomposition mechanism used i...