Sciweavers

190 search results - page 6 / 38
» Improving the Held and Karp Approach with Constraint Program...
Sort
View
CP
2005
Springer
14 years 1 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
AOSD
2007
ACM
13 years 11 months ago
Improve pointcut definitions with program views
Aspect-oriented programming languages select join points using pointcut constructs that depend on the syntactic structure of the base program. As the base program evolves, the poi...
Zifu Yang, Tian Zhao
IEEECIT
2010
IEEE
13 years 6 months ago
Promoting Multi-Core Education via Special Training and Workshop Program
—Multi-core technology is becoming the mainstream of processor architecture. It is a great challenge for universities to offer students new theories because of the continuous cha...
Wei Hu, Tianzhou Chen, Jingwei Liu, Qingsong Shi
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 7 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
DAC
1997
ACM
13 years 11 months ago
An Improved Algorithm for Minimum-Area Retiming
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
Naresh Maheshwari, Sachin S. Sapatnekar