3049 search results - page 67 / 610 » On the Convergence of Bound Optimization Algorithms |
152
click to vote
ISPD
2003
ACM
15 years 9 months ago
2003
ACM
This paper presents a new timing driven force directed placement algorithm that meets physical net length constraints as well as constraints on specific pin sets. It is the first ...
115
click to vote
COLT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We propose simple randomized strategies for sequential prediction under imperfect monitoring, that is, when the forecaster does not have access to the past outcomes but r...
132
click to vote
COR
2007
15 years 4 months ago
2007
Lot-sizing problems are cornerstone optimization problems for production planning with time varying demand. We analyze the quality of bounds, both lower and upper, provided by a r...
118
click to vote
MOC
2000
15 years 4 months ago
2000
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
260
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent charact...