6105 search results - page 147 / 1221 » A Parallel Algorithm for Bound-Smoothing |
126
Voted
ICIP
1995
IEEE
16 years 6 months ago
1995
IEEE
127
click to vote
FGCS
2006
15 years 5 months ago
2006
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
143
click to vote
GECCO
2008
Springer
15 years 6 months ago
2008
Springer
In this paper an island model is described for the unconstrained Binary Quadratic Problem (BQP), which can be used with up to 2500 binary variables. Our island model uses a master...
166
click to vote
TPDS
2008
15 years 5 months ago
2008
Power consumption is an important issue for cluster supercomputers as it directly affects running cost and cooling requirements. This paper investigates the memory energy efficienc...