1545 search results - page 286 / 309 » On tree congestion of graphs |
AAAI
2010
14 years 11 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
LREC
2008
14 years 11 months ago
2008
Ontology construction usually requires a domain-specific corpus for building corresponding concept hierarchy. The domain corpus must have a good coverage of domain knowledge. Wiki...
IJCAI
2007
14 years 11 months ago
2007
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
NIPS
2008
14 years 11 months ago
2008
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
LWA
2007
14 years 11 months ago
2007
Large, high dimensional data spaces, are still a challenge for current data clustering methods. Frequent Termset (FTS) clustering is a technique developed to cope with these chall...