1174 search results - page 63 / 235 » Functional Trees |
JAIR
2011
13 years 4 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
ISNN
2005
Springer
14 years 3 months ago
2005
Springer
Current Intrusion Detection Systems (IDS) examine all data features to detect intrusion or misuse patterns. Some of the features may be redundant or contribute little (if anything)...
ICALP
2000
Springer
14 years 1 months ago
2000
Springer
We establish that the algorithmic complexity of the minimum spanning tree problem is equal to its decision-tree complexity. Specifically, we present a deterministic algorithm to fi...
SODA
2008
ACM
13 years 11 months ago
2008
ACM
We introduce a new technique to bound the asymptotic performance of splay trees. The basic idea is to transcribe, in an indirect fashion, the rotations performed by the splay tree...
AAAI
1996
13 years 11 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...