Sciweavers

8838 search results - page 1730 / 1768
» Generalizing Domain Theory
Sort
View
ESA
1998
Springer
162views Algorithms» more  ESA 1998»
13 years 11 months ago
External Memory Algorithms
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
Jeffrey Scott Vitter
KDD
2000
ACM
81views Data Mining» more  KDD 2000»
13 years 11 months ago
Targeting the right students using data mining
The education domain offers a fertile ground for many interesting and challenging data mining applications. These applications can help both educators and students, and improve th...
Yiming Ma, Bing Liu, Ching Kian Wong, Philip S. Yu...
VLDB
2000
ACM
120views Database» more  VLDB 2000»
13 years 11 months ago
Integrating the UB-Tree into a Database System Kernel
Multidimensional access methods have shown high potential for significant performance improvements in various application domains. However, only few approaches have made their way...
Frank Ramsak, Volker Markl, Robert Fenk, Martin Zi...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 years 11 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 11 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
« Prev « First page 1730 / 1768 Last » Next »