Sciweavers

3250 search results - page 52 / 650
» An Algorithm to Solve a Linear Program
Sort
View
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
15 years 3 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen
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
JAIR
2008
121views more  JAIR 2008»
14 years 9 months ago
A Constraint Programming Approach for Solving a Queueing Control Problem
In a facility with front room and back room operations, it is useful to switch workers between the rooms in order to cope with changing customer demand. Assuming stochastic custom...
Daria Terekhov, J. Christopher Beck
63
Voted
ASPDAC
2008
ACM
86views Hardware» more  ASPDAC 2008»
14 years 11 months ago
An MILP-based wire spreading algorithm for PSM-aware layout modification
Phase shifting mask (PSM) is a promising resolution enhancement technique, which is used in the deep sub-wavelength lithography of the VLSI fabrication process. However, applying ...
Ming-Chao Tsai, Yung-Chia Lin, Ting-Chi Wang
CP
2008
Springer
14 years 11 months ago
Solving a Telecommunications Feature Subscription Configuration Problem
Abstract. Call control features (e.g., call-divert, voice-mail) are primitive options to which users can subscribe off-line to personalise their service. The configuration of a fea...
David Lesaint, Deepak Mehta, Barry O'Sullivan, Lui...