1402 search results - page 119 / 281 » Searching Cycle-Disjoint Graphs |
116
click to vote
AAAI
2008
15 years 10 days ago
2008
Traditional artificial intelligence techniques do not perform well in applications such as real-time strategy games because of the extensive search spaces which need to be explore...
CIKM
2008
Springer
15 years 16 hour ago
2008
Springer
We introduce a multi-stage ensemble framework, ErrorDriven Generalist+Expert or Edge, for improved classification on large-scale text categorization problems. Edge first trains a ...
122
click to vote
EWCBR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time re...
TALG
2008
14 years 10 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
We describe efficient techniques for construction of large term co-occurrence graphs, and investigate an application to the discovery of numerous fine-grained (specific) topics. A...