Sciweavers

610 search results - page 104 / 122
» Using SAT in QBF
Sort
View
COMBINATORICS
2004
102views more  COMBINATORICS 2004»
13 years 7 months ago
Satisfiability and Computing van der Waerden Numbers
In this paper we bring together the areas of combinatorics and propositional satisfiability. Many combinatorial theorems establish, often constructively, the existence of positive...
Michael R. Dransfield, Lengning Liu, Victor W. Mar...
DAC
2003
ACM
14 years 8 months ago
Temporofunctional crosstalk noise analysis
Noise affects circuit operation by increasing gate delays and causing latches to capture incorrect values. This paper proposes a method of characterizing correlation of signal tra...
Donald Chai, Alex Kondratyev, Yajun Ran, Kenneth H...
WWW
2006
ACM
14 years 8 months ago
Learning and inferencing in user ontology for personalized semantic web services
Domain ontology has been used in many Semantic Web applications. However, few applications explore the use of ontology for personalized services. This paper proposes an ontology b...
Xing Jiang, Ah-Hwee Tan
FPGA
2009
ACM
180views FPGA» more  FPGA 2009»
14 years 2 months ago
Scalable don't-care-based logic optimization and resynthesis
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is cap...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...
LPNMR
2009
Springer
14 years 2 months ago
A Module-Based Framework for Multi-language Constraint Modeling
We develop a module-based framework for constraint modeling where it is possible to combine different constraint modeling languages and exploit their strengths in a flexible way. ...
Matti Järvisalo, Emilia Oikarinen, Tomi Janhu...