12659 search results - page 381 / 2532 » The distributed breakout algorithms |
192
click to vote
ISCOPE
1999
Springer
15 years 11 months ago
1999
Springer
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical frame...
197
Voted
PVM
1999
Springer
15 years 11 months ago
1999
Springer
The problem of solving sparse Systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are pr...
172
click to vote
PPSN
1998
Springer
15 years 11 months ago
1998
Springer
Abstract. In order to escape from local optima, it is standard practice to periodically restart a genetic algorithm according to some restart criteria/policy. This paper addresses ...
173
Voted
ICPP
1989
IEEE
15 years 11 months ago
1989
IEEE
Efficient hypercube algorithms are developed for the following image transformations: shrinking, expanding, translation, rotation, and scaling. A 2k −step shrinking and expandi...
215
Voted
CP
2006
Springer
15 years 11 months ago
2006
Springer
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...