Proceedings Article10.1145/513918.514142
ILP-based engineering change
Farinaz Koushanfar,Jennifer L. Wong,Jessica Feng,Miodrag Potkonjak +3 more
- 10 Jun 2002
- pp 910-915
TL;DR: The generic methodology to Boolean Satisfiability (SAT) problem is applied and the effectiveness of all proposed approaches and algorithms is demonstrated on standard benchmarks.
read more
Abstract: We have developed a generic integer linear programming (ILP)-based engineering change (EC) methodology. The EC methodology has three components: enabling, fast, and preserving. Enabling EC provides a user with the means to specify the amount of flexibility and how this flexibility should be distributed throughout the solution so that one can guarantee that a specific set of EC demands can be satisfied while preserving the quality of the initially obtained solution. Fast EC conducts changes in a fraction of the time needed to solve the problem while preserving or in some cases improving the quality of the initial solution. Preserving EC maintains either user specified components of the solution or as much as possible of the initial solution while still guaranteeing an optimal solution to the altered problem instance. We applied the generic methodology to the Boolean satisfiability (SAT) problem. The effectiveness of all proposed approaches and algorithms is demonstrated on standard benchmarks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Spare Cells With Constant Insertion for Engineering Change
TL;DR: An iterative method to determine feasible mapping solutions for an EC problem considering spare cells whose inputs can be connected to Vdd or Gnd and suggests that constant insertion reduces the area required to find a feasible mapping solution to 80% of that with no constant insertion for the selected EC equations.
29
Engineering change using spare cells with constant insertion
Yu-Min Kuo,Ya-Ting Chang,Shih-Chieh Chang,M. Marek-Sadovvska +3 more
- 05 Nov 2007
TL;DR: An iterative method to generate feasible mapping solutions for an EC problem considering spare cells whose inputs may be tied to Vdd or Gnd, called constant insertion is proposed.
28
Spare Cells With Constant Insertion for Engineering Change
Shin'ichiro Mutoh,Takakuni Douseki,Yasuyuki Matsuya,Takao Aoki,Satoshi Shigematsu +4 more
- 01 Jan 2009
TL;DR: An iterative method to determine feasible mapping solutions for an EC problem considering spare cells whose inputs can be connected to VLSI, and results suggest that constant insertion reduces the area required to find a feasible mapping solution to 80% of that with no constant insertion for the selected EC equations.
3
Deriving Event Graphs through Process Mining for Runtime Change Management
Hongyu Zhang,Yong Liu,Cong Li,R. Jiao +3 more
- 01 Jan 2010
TL;DR: Engineering Changes (ECs) refer to any modifications in forms, fits, functions, materials, services and so on in product design, development and the subsequent manufacturing operations.
2
References
Combinatorial optimization: algorithms and complexity
TL;DR: This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NPcomplete problems, more.
7.6K
•Book
Theory of Linear and Integer Programming
Alexander Schrijver
- 01 Dec 1986
TL;DR: Introduction and Preliminaries.
Combinatorial optimization:Algorithms and complexity
TL;DR: Eventually, you will unquestionably discover a supplementary experience and achievement by Spending more cash by spending more cash.
5K
•Book
Integer programming
George L. Nemhauser,Laurence A. Wolsey +1 more
- 01 Jan 1972
TL;DR: The principles of integer programming are directed toward finding solutions to problems from the fields of economic planning, engineering design, and combinatorial optimization as mentioned in this paper, which is a standard of graduate-level courses since 1972.
4.6K
Algorithms for the Satisfiability (SAT) Problem: A Survey,
Jun Gu,Paul Walton Purdom,John Franco,Benjamin W. Wah +3 more
- 01 Jan 1996
TL;DR: This survey presents a general framework (an algorithm space) that integrates existing SAT algorithms into a unified perspective and describes sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms.