Sciweavers

5766 search results - page 1025 / 1154
» Reverse Engineering of Data
Sort
View
DAC
2007
ACM
15 years 8 months ago
Memory Modeling in ESL-RTL Equivalence Checking
When designers create RTL models from a system-level specification, arrays in the system-level model are often implemented as memories in the RTL. Knowing the correspondence betwe...
Alfred Kölbl, Jerry R. Burch, Carl Pixley
CAV
2010
Springer
214views Hardware» more  CAV 2010»
15 years 8 months ago
Learning Component Interfaces with May and Must Abstractions
elor Thesis: Demand Driven Abstraction Refinement • Advisor: Dr. Andrey Rybalchenko Kendriya Vidyalaya ONGC, Dehradun, Uttaranchal INDIA All India Senior Secondary Examination, ...
Rishabh Singh, Dimitra Giannakopoulou, Corina S. P...
DAC
2010
ACM
15 years 8 months ago
An AIG-Based QBF-solver using SAT for preprocessing
In this paper we present a solver for Quantified Boolean Formulas (QBFs) which is based on And-Inverter Graphs (AIGs). We use a new quantifier elimination method for AIGs, which...
Florian Pigorsch, Christoph Scholl
SIGIR
2010
ACM
15 years 8 months ago
How good is a span of terms?: exploiting proximity to improve web retrieval
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
Krysta Marie Svore, Pallika H. Kanani, Nazan Khan
SIGIR
2010
ACM
15 years 8 months ago
Learning more powerful test statistics for click-based retrieval evaluation
Interleaving experiments are an attractive methodology for evaluating retrieval functions through implicit feedback. Designed as a blind and unbiased test for eliciting a preferen...
Yisong Yue, Yue Gao, Olivier Chapelle, Ya Zhang, T...
« Prev « First page 1025 / 1154 Last » Next »