95 search results - page 10 / 19 » Solving Large-Scale Nonlinear Programming Problems by Constr... |
COCOS
2003
Springer
14 years 25 days ago
2003
Springer
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
System-on-chip and system-in-package result in increased number of I/O cells and complicated constraints for both chip designs and package designs. This renders the traditional ma...
ISQED
2002
IEEE
14 years 15 days 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...
CP
2009
Springer
14 years 8 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
NIPS
2008
13 years 9 months ago
2008
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...