Sciweavers

923 search results - page 169 / 185
» Proving the value of formal methods
Sort
View
104
Voted
CADE
1998
Springer
15 years 6 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
SIAMCOMP
2010
83views more  SIAMCOMP 2010»
15 years 8 days ago
Reaching and Distinguishing States of Distributed Systems
Some systems interact with their environment at physically distributed interfaces, called ports, and in testing such a system it is normal to place a tester at each port. Each test...
Robert M. Hierons
SIGIR
2006
ACM
15 years 7 months ago
AggregateRank: bringing order to web sites
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...
CSB
2005
IEEE
137views Bioinformatics» more  CSB 2005»
15 years 7 months ago
A Learned Comparative Expression Measure for Affymetrix GeneChip DNA Microarrays
Perhaps the most common question that a microarray study can ask is, “Between two given biological conditions, which genes exhibit changed expression levels?” Existing methods...
Will Sheffler, Eli Upfal, John Sedivy, William Sta...
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
15 years 3 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang