644 search results - page 12 / 129 » Decomposition Complexity |
105
Voted
TCS
2008
15 years 10 days ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
CP
2005
Springer
15 years 6 months ago
2005
Springer
Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real...
DAM
2007
15 years 12 days ago
2007
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
96
Voted
KDD
1997
ACM
15 years 4 months ago
1997
ACM
We present a novel data mining approach based on decomposition. In order to analyze a given dataset, the method decomposes it to a hierarchy of smaller and less complex datasets t...
77
Voted
AAAI
1994
15 years 1 months ago
1994
Most practical work on AI planningsystems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little an...