149 search results - page 15 / 30 » Solving large scale combinatorial optimization using PMA-SLS |
169
click to vote
CONSTRAINTS
2011
14 years 8 months ago
2011
Abstract. We consider the problem of decomposing an integer matrix into a positively weighted sum of binary matrices that have the consecutive-ones property. This problem is well-k...
147
Voted
JMLR
2006
15 years 4 months ago
2006
The problem of finding the most probable (MAP) configuration in graphical models comes up in a wide range of applications. In a general graphical model this problem is NP hard, bu...
140
click to vote
CEC
2010
IEEE
15 years 5 months ago
2010
IEEE
— Ant-colony optimization (ACO) is a popular swarm intelligence metaheuristic scheme that can be applied to almost any optimization problem. In this paper, we address a performan...
123
click to vote
DATE
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper is about gate sizing under a statistical delay model. It shows we can solve the gate sizing problem exactly for a given statistical delay model. The formulation used al...
160
click to vote
ISQED
2002
IEEE
15 years 10 months ago
2002
IEEE
This paper presents a fast algorithm to optimize both the widths and lengths of power/ground networks under reliability and power dip/ground bounce constraints. The spacesizing wh...