4137 search results - page 612 / 828 » On the number of matchings of a tree |
ICCBR
2007
Springer
14 years 2 months ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
ICDE
2006
IEEE
14 years 2 months ago
2006
IEEE
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
ICMCS
2006
IEEE
14 years 2 months ago
2006
IEEE
Given a time horizon parameter h and an object set O, predictive collision detection finds all the object pairs < oi, oj, ti > which will collide in the future time interva...
IJCNN
2006
IEEE
14 years 2 months ago
2006
IEEE
— The number of XML documents produced and available on the Internet is steadily increasing. It is thus important to devise automatic procedures to extract useful information fro...