3758 search results - page 640 / 752 » A Complete Subsumption Algorithm |
103
click to vote
SWAT
1992
Springer
15 years 1 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
145
click to vote
SIGAL
1990
15 years 1 months ago
1990
We propose and analyse a quasirandom analogue to the classical push model for disseminating information in networks ("randomized rumor spreading"). In the classical mode...
DAC
2010
ACM
15 years 1 months ago
2010
ACM
As device size shrinks to the nanometer range, FPGAs are increasingly prone to manufacturing defects. We anticipate that the ability to tolerate multiple defects will be very impo...
104
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Classification is one of the most essential tasks in data mining. Unlike other methods, associative classification tries to find all the frequent patterns existing in the input...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper proposes a new smart crossover operator for a Pittsburgh Learning Classifier System. This operator, unlike other recent LCS approaches of smart recombination, does not ...