1182 search results - page 56 / 237 » Iterative Methods in Combinatorial Optimization |
119
click to vote
CVPR
2005
IEEE
16 years 4 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
114
click to vote
ASPDAC
2009
ACM
15 years 8 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
131
click to vote
ICCAD
1995
IEEE
15 years 5 months ago
1995
IEEE
We address the problem of minimizing power consumption in behavioral synthesis of data-dominated circuits. The complex nature of power as a cost function implies that the effects ...
137
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
114
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...