6105 search results - page 320 / 1221 » A Parallel Algorithm for Bound-Smoothing |
174
click to vote
ICPP
2006
IEEE
16 years 23 days ago
2006
IEEE
— This paper presents Salsa, a novel, decentralized and asynchronous realization of the “replica exchange” algorithm for simulating the structure, function, folding, and dyna...
153
click to vote
SYNASC
2005
IEEE
16 years 9 days ago
2005
IEEE
— A framework that describes the evolution of P systems with bounded parallelism is defined by introducing basic formal features that can be then integrated into a structural op...
161
click to vote
PREMI
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We develop a framework for parallel computation of the optimal rough set decision reducts from data. We adapt the island model for evolutionary computing. The idea is to ...
170
click to vote
EUROPAR
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Mixed-parallelism, the combination of data- and taskparallelism, is a powerful way of increasing the scalability of entire classes of parallel applications on platforms c...
187
click to vote
NIXDORF
1992
15 years 10 months ago
1992
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...