874 search results - page 82 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
APIN
2005
13 years 9 months ago
2005
In this paper, we study the 3-D container packing problem. The problem is divided into box selection, space selection, box orientation and new space generation sub-problems. As a f...
CASCON
1993
13 years 10 months ago
1993
The growth of commercial and academic interest in parallel and distributed computing during the past fifteen years has been accompanied by a corresponding increase in the number o...
SIPS
2007
IEEE
14 years 3 months ago
2007
IEEE
Motivated by the need for high throughput sphere decoding for multipleinput-multiple-output (MIMO) communication systems, we propose a parallel depth-first sphere decoding (PDSD)...
SAC
1998
ACM
14 years 1 months ago
1998
ACM
The fast messy genetic algorithm (fmGA) belongs to a class of algorithms inspired by the principles of evolution, known appropriately as "evolutionary algorithms" (EAs)....