Sciweavers

190 search results - page 13 / 38
» Improved Algorithm for the Soft Global Cardinality Constrain...
Sort
View
CP
2005
Springer
15 years 3 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
CPAIOR
2010
Springer
14 years 8 months ago
Boosting Set Constraint Propagation for Network Design
Abstract. This paper reconsiders the deployment of synchronous optical networks (SONET), an optimization problem naturally expressed in terms of set variables. Earlier approaches, ...
Justin Yip, Pascal Van Hentenryck, Carmen Gervet
INFOCOM
2011
IEEE
14 years 1 months ago
Optimal sampling algorithms for frequency estimation in distributed data
—Consider a distributed system with n nodes where each node holds a multiset of items. In this paper, we design sampling algorithms that allow us to estimate the global frequency...
Zengfeng Huang, Ke Yi, Yunhao Liu, Guihai Chen
GLVLSI
1996
IEEE
125views VLSI» more  GLVLSI 1996»
15 years 1 months ago
Performance-Driven Interconnect Global Routing
In this paper, we propose a global routing algorithm for multi-layer building-block layouts. The algorithm is based on successive ripup and rerouting while satisfying edge capacit...
Dongsheng Wang, Ernest S. Kuh
CVPR
2012
IEEE
13 years 2 days ago
Multiclass pixel labeling with non-local matching constraints
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
Stephen Gould