822 search results - page 58 / 165 » Descendants in Increasing Trees |
AIPS
2008
14 years 12 days ago
2008
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
CIKM
2008
Springer
14 years 1 days ago
2008
Springer
Machine Learned Ranking approaches have shown successes in web search engines. With the increasing demands on developing effective ranking functions for different search domains, ...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
UMUAI
1998
13 years 9 months ago
1998
A modeling system may be required to predict an agent’s future actions under constraints of inadequate or contradictory relevant historical evidence. This can result in low predi...
KDD
2012
ACM
12 years 15 days ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...