500 search results - page 64 / 100 » A parallel quadratic programming method for dynamic optimiza... |
96
Voted
PPSN
2000
Springer
15 years 2 months ago
2000
Springer
In this paper, we propose a competitive image segmentation algorithm. It is a dynamic evolving optimization method, which we call the population algorithm. The method is inspired f...
100
click to vote
ICDCS
2008
IEEE
15 years 5 months ago
2008
IEEE
A multi-object operation incurs communication or synchronization overhead when the requested objects are distributed over different nodes. The object pair correlations (the probab...
ASPDAC
1999
ACM
15 years 3 months ago
1999
ACM
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
IPPS
1997
IEEE
15 years 3 months ago
1997
IEEE
Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these a...
100
click to vote
NN
2008
Springer
14 years 11 months ago
2008
Springer
Wide-area coordinating control is becoming an important issue and a challenging problem in the power industry. This paper proposes a novel optimal wide-area coordinating neurocont...