Sciweavers

4940 search results - page 174 / 988
» On the Complexity of Universal Programs
Sort
View
DAC
1997
ACM
15 years 9 months ago
A C-Based RTL Design Verification Methodology for Complex Microprocessor
Cr, As the complexity of high-performance microprocessor increases, functional verification becomes more and more difficult and RTL simulation emerges as the bottleneck of the des...
Joon-Seo Yim, Yoon-Ho Hwang, Chang-Jae Park, Hoon ...
133
Voted
ENTCS
2008
102views more  ENTCS 2008»
15 years 5 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
SAS
2010
Springer
141views Formal Methods» more  SAS 2010»
15 years 3 months ago
Statically Inferring Complex Heap, Array, and Numeric Invariants
We describe Deskcheck, a parametric static analyzer that is able to establish properties of programs that manipulate dynamically allocated memory, arrays, and integers. Deskcheck c...
Bill McCloskey, Thomas W. Reps, Mooly Sagiv
SIGDIAL
2010
15 years 2 months ago
Dialogue Act Modeling in a Complex Task-Oriented Domain
Classifying the dialogue act of a user utterance is a key functionality of a dialogue management system. This paper presents a data-driven dialogue act classifier that is learned ...
Kristy Elizabeth Boyer, Eun Y. Ha, Robert Phillips...
141
Voted
ACL
2009
15 years 2 months ago
Do Automatic Annotation Techniques Have Any Impact on Supervised Complex Question Answering?
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
Yllias Chali, Sadid A. Hasan, Shafiq R. Joty