6105 search results - page 264 / 1221 » A Parallel Algorithm for Bound-Smoothing |
179
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
The paper presents the design of a hardware genetic algorithm which uses a pipeline of systolic arrays. Demostrated is the design methodology, where a simple genetic algorithm exp...
151
click to vote
ASAP
1996
IEEE
15 years 10 months ago
1996
IEEE
We propose in this paper a new algorithm and architecture for performing divisions in residue number systems. Our algorithm is suitable for residue number systems with large modul...
190
click to vote
PPSN
1994
Springer
15 years 10 months ago
1994
Springer
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
172
click to vote
FTDCS
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper deals with the problem of scheduling aperiodic groups of tasks in distributed systems. It proposes two contributions, namely: i) a distributed scheduling algorithm to b...
138
click to vote
IPPS
2007
IEEE
16 years 28 days ago
2007
IEEE
We propose a generic algorithmic model called STAMP (Synchronous, Transactional, and Asynchronous MultiProcessing) as a universal performance and power complexity model for multit...