2303 search results - page 55 / 461 » Interior-Point Methods in Parallel Computation |
GI
2004
Springer
14 years 3 months ago
2004
Springer
: With the growing complexity of parallel architectures, the probability of system failures grows, too. One approach to cope with this problem is the self-healing, one of the organ...
CVPR
2010
IEEE
14 years 6 months ago
2010
IEEE
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
ISHPC
2003
Springer
14 years 3 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
ICIAP
1997
ACM
14 years 2 months ago
1997
ACM
The European Concerted Action \COMPARES" (Concerted Action on COnnectionist Methods for Preprocessing and Analysis of REmote Sensing Data) was funded within the Environment an...
PPSN
1998
Springer
14 years 2 months ago
1998
Springer
Abstract. This paper describes a parallel model for a distributed memory architecture of a non traditional evolutionary computation method, which integrates constraint propagation ...