47 search results - page 6 / 10 » And Or Trees Revisited |
AUSAI
2006
Springer
13 years 11 months ago
2006
Springer
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
AIPS
2010
13 years 6 months ago
2010
Evolutionary trees of species can be reconstructed by pairwise comparison of their entire genomes. Such a comparison can be quantified by determining the number of events that ch...
KDD
2003
ACM
14 years 7 months ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
C3S2E
2008
ACM
13 years 9 months ago
2008
ACM
We take another look at the 2DR-tree. In particular, we revisit its node structure, validity rules and the insertion strategy. The 2DR-tree uses 2D nodes so that the relationships...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...