128 search results - page 11 / 26 » Parallel Simulated Annealing Algorithm for Graph Coloring Pr... |
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
We present in this work a wide spectrum of results on analyzing the behavior of parallel heuristics for solving optimization problems. We focus on evolutionary algorithms as well ...
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
HPCC
2007
Springer
14 years 1 months ago
2007
Springer
Many of today’s embedded systems, such as wireless and portable devices rely heavily on the limited power supply. Therefore, energy efficiency becomes one of the major design con...
DNA
2004
Springer
14 years 1 months ago
2004
Springer
Most DNA computing algorithms for mathematical problems start with combinatorial generation of an initial pool. Several methods for initialpool generation have been proposed, inclu...
CAIP
2001
Springer
14 years 7 days ago
2001
Springer
In this paper, we propose a Markov random field (MRF) image segmentation model which aims at combining color and texture features. The theoretical framework relies on Bayesian est...