112 search results - page 2 / 23 » Lagrangian Relaxation |
COCOA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
ICCAD
2006
IEEE
14 years 2 months ago
2006
IEEE
With the advent of deep sub-micron (DSM) era, floorplanning has become increasingly important in physical design process. In this paper we clarify a misunderstanding in using Lag...
ICCAD
2004
IEEE
14 years 2 months ago
2004
IEEE
Abstract— This paper presents a post-route, timingconstrained gate-sizing algorithm for crosstalk reduction. Gate-sizing has emerged as a practical and feasible method to reduce ...
ISPD
2000
ACM
13 years 9 months ago
2000
ACM
modules can be handled in constraint graphs efficiently. This Floorplan area minimization is an important problem because many modules have shape flexibilities during the floorplan...
ICRA
1994
IEEE
13 years 9 months ago
1994
IEEE
In this article, we develop three eflcient extensions to a recent production scheduling algorithm based on Lagrangian relaxation [9]. These extensions handle the following real-wo...