6437 search results - page 128 / 1288 » Parallel Algorithms for Arrangements |
99
Voted
JPDC
2006
15 years 2 months ago
2006
This paper focuses on solving large size combinatorial optimization problems using a Grid-enabled framework called ParadisEO
ISPA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A loop with irregular assignment computations contains loopcarried output data dependences that can only be detected at run-time. In this paper, a load-balanced method ba...
115
Voted
SIAMCOMP
2010
14 years 9 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...
128
Voted
CEC
2003
IEEE
15 years 8 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 ...
108
click to vote
ICCD
1997
IEEE
15 years 6 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...