1376 search results - page 84 / 276 » Searching Trees: An Essay |
135
click to vote
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
116
click to vote
ENTCS
2006
14 years 12 months ago
2006
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
ACNS
2005
Springer
15 years 5 months ago
2005
Springer
We introduce novel techniques for organizing the indexing structures of how data is stored so that alterations from an original version can be detected and the changed values speci...
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
To improve popular services discovery mechanism (UDDI mainly), we propose an agent-based services discovery mechanism. In this mechanism, services information is stored in distribu...
100
click to vote
IJCAI
2003
15 years 1 months ago
2003
We present an algorithm Pref-AC that limits arc consistency (AC) to the preferred choices of a tree search procedure and that makes constraint solving more efficient without chan...