Sciweavers

5263 search results - page 113 / 1053
» Open Constraint Optimization
Sort
View
DAC
2006
ACM
16 years 4 months ago
An efficient and versatile scheduling algorithm based on SDC formulation
Scheduling plays a central role in the behavioral synthesis process, which automatically compiles high-level specifications into optimized hardware implementations. However, most ...
Jason Cong, Zhiru Zhang
126
Voted
CP
2008
Springer
15 years 5 months ago
Universal Booleanization of Constraint Models
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
Jinbo Huang
138
Voted
ICCAD
1994
IEEE
117views Hardware» more  ICCAD 1994»
15 years 7 months ago
Optimization of critical paths in circuits with level-sensitive latches
A simple extension of the critical path method is presented which allows more accurate optimization of circuits with level-sensitive latches. The extended formulation provides a s...
Timothy M. Burks, Karem A. Sakallah
CP
2003
Springer
15 years 8 months ago
Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorit...
Meinolf Sellmann
AAAI
2004
15 years 5 months ago
The Practice of Approximated Consistency for Knapsack Constraints
Knapsack constraints are a key modeling structure in discrete optimization and form the core of many real-life problem formulations. Only recently, a cost-based filtering algorith...
Meinolf Sellmann