Sciweavers

3146 search results - page 268 / 630
» Efficient Consequence Finding
Sort
View
KDD
1997
ACM
78views Data Mining» more  KDD 1997»
15 years 10 months ago
Mining Generalized Term Associations: Count Propagation Algorithm
We presenthere an approachand algorithm for mining generalizedterm associations.The problem is to find co-occurrencefrequenciesof terms, given a collection of documents eachwith r...
Jonghyun Kahng, Wen-Hsiang Kevin Liao, Dennis McLe...
ECAI
1992
Springer
15 years 10 months ago
On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
Ilkka Niemelä, Jussi Rintanen
CIKM
2009
Springer
15 years 10 months ago
Empirical justification of the gain and discount function for nDCG
The nDCG measure has proven to be a popular measure of retrieval effectiveness utilizing graded relevance judgments. However, a number of different instantiations of nDCG exist, d...
Evangelos Kanoulas, Javed A. Aslam
CGO
2004
IEEE
15 years 10 months ago
Compiler Optimization of Memory-Resident Value Communication Between Speculative Threads
Efficient inter-thread value communication is essential for improving performance in Thread-Level Speculation (TLS). Although several mechanisms for improving value communication ...
Antonia Zhai, Christopher B. Colohan, J. Gregory S...
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 10 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule