Sciweavers

851 search results - page 27 / 171
» Inaccessibility in Decision Procedures
Sort
View
ASE
2005
140views more  ASE 2005»
13 years 7 months ago
Automated Procedure Construction for Deductive Synthesis
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
Steve Roach, Jeffrey Van Baalen
CASES
2010
ACM
13 years 5 months ago
Improved procedure placement for set associative caches
The performance of most embedded systems is critically dependent on the memory hierarchy performance. In particular, higher cache hit rate can provide significant performance boos...
Yun Liang, Tulika Mitra
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
An Even Closer Integration of Linear Arithmetic into Inductive Theorem Proving
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...
Tobias Schmidt-Samoa
BMCBI
2006
154views more  BMCBI 2006»
13 years 7 months ago
An improved procedure for gene selection from microarray experiments using false discovery rate criterion
Background: A large number of genes usually show differential expressions in a microarray experiment with two types of tissues, and the p-values of a proper statistical test are o...
James J. Yang, Mark C. K. Yang
AAAI
2008
13 years 10 months ago
POIROT - Integrated Learning of Web Service Procedures
POIROT is an integration framework for combining machine learning mechanisms to learn hierarchical models of web services procedures from a single or very small set of demonstrati...
Mark H. Burstein, Robert Laddaga, David McDonald, ...