6105 search results - page 141 / 1221 » A Parallel Algorithm for Bound-Smoothing |
129
click to vote
SIAMCOMP
2010
14 years 11 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
150
Voted
CEC
2003
IEEE
15 years 10 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
133
Voted
ICCD
1997
IEEE
15 years 9 months ago
1997
IEEE
In this paper, we present a parallel-array implementation of a new non-restoring square root algorithm (PASQRT). The carry-save adder (CSA) is used in the parallel array. The PASQ...
152
click to vote
EVOW
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. This paper deals with the mapping of the parallel islandbased genetic algorithm with unidirectional ring migrations to nVidia CUDA software model. The proposed mapping is...
159
Voted
INFORMATICALT
2006
15 years 5 months ago
2006
We know the necessity for information security becomes more widespread in these days, especially for hardware-based implementations such as smart cards chips for wireless applicati...