Sciweavers

2266 search results - page 352 / 454
» Evolutionary Algorithms for the Satisfiability Problem
Sort
View
178
Voted
DEXAW
2005
IEEE
156views Database» more  DEXAW 2005»
16 years 1 months ago
Fixing Inconsistent Databases by Updating Numerical Attributes
For several reasons a database may not satisfy certain integrity constraints (ICs). However, most likely most of the information in it is still consistent with the ICs; and could ...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...
204
Voted
GD
2005
Springer
16 years 29 days ago
MultiPlane: A New Framework for Drawing Graphs in Three Dimensions
This paper presents a new framework for drawing graphs in three dimensions. In general, the new framework uses a divide and conquer approach. More specifically, the framework divi...
Seok-Hee Hong
204
Voted
SAT
2005
Springer
123views Hardware» more  SAT 2005»
16 years 27 days ago
Bounded Model Checking with QBF
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
Nachum Dershowitz, Ziyad Hanna, Jacob Katz
168
Voted
FMCAD
2004
Springer
16 years 24 days ago
Approximate Symbolic Model Checking for Incomplete Designs
We consider the problem of checking whether an incomplete design can still be extended to a complete design satisfying a given CTL formula and whether the property is satisfied fo...
Tobias Nopper, Christoph Scholl
ITC
2002
IEEE
81views Hardware» more  ITC 2002»
16 years 10 days ago
Design Rewiring Using ATPG
—Logic optimization is the step of the very large scale integration (VLSI) design cycle where the designer performs modifications on a design to satisfy different constraints suc...
Andreas G. Veneris, Magdy S. Abadir, Mandana Amiri