2543 search results - page 213 / 509 » Optimal Ordered Problem Solver |
109
click to vote
DAC
2007
ACM
16 years 4 months ago
2007
ACM
In this paper, we propose TROY, the first track router with yield-driven wire planning to optimize yield loss due to random defects. As the probability of failure (POF) computed f...
132
Voted
LPAR
2005
Springer
15 years 9 months ago
2005
Springer
Local search algorithms are one of the effective methods for solving hard combinatorial problems. However, a serious problem of this approach is that the search often traps at loca...
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we describe an improvement of an entropy-based diversity preservation approach for evolutionary algorithms. This approach exploits the information contained not only...
140
click to vote
JMLR
2006
2006
Learning Sparse Representations by Non-Negative Matrix Factorization and Sequential Cone Programming
15 years 3 months ago
We exploit the biconvex nature of the Euclidean non-negative matrix factorization (NMF) optimization problem to derive optimization schemes based on sequential quadratic and secon...
121
Voted
GLOBECOM
2010
IEEE
15 years 1 months ago
2010
IEEE
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...