Sciweavers

507 search results - page 24 / 102
» Sizes of Ordered Decision Trees
Sort
View
ISCI
2006
96views more  ISCI 2006»
13 years 8 months ago
A comparison of classification accuracy of four genetic programming-evolved intelligent structures
We investigate the effectiveness of GP-generated intelligent structures in classification tasks. Specifically, we present and use four context-free grammars to describe (1) decisi...
Athanasios Tsakonas
SODA
2008
ACM
150views Algorithms» more  SODA 2008»
13 years 9 months ago
Finding an optimal tree searching strategy in linear time
We address the extension of the binary search technique from sorted arrays and totally ordered sets to trees and tree-like partially ordered sets. As in the sorted array case, the...
Shay Mozes, Krzysztof Onak, Oren Weimann
ECAI
2004
Springer
14 years 1 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano
LICS
1997
IEEE
14 years 4 days ago
Ground Reducibility is EXPTIME-Complete
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
Hubert Comon, Florent Jacquemard
SIGMETRICS
2003
ACM
147views Hardware» more  SIGMETRICS 2003»
14 years 1 months ago
Effect of node size on the performance of cache-conscious B+-trees
In main-memory databases, the number of processor cache misses has a critical impact on the performance of the system. Cacheconscious indices are designed to improve performance b...
Richard A. Hankins, Jignesh M. Patel