1434 search results - page 187 / 287 » Graph Searching with Advice |
181
Voted
EWCBR
2008
Springer
15 years 5 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...
150
Voted
TALG
2008
15 years 3 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...
136
Voted
CIKM
2010
Springer
15 years 1 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...
195
Voted
PODC
2011
ACM
14 years 6 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
141
Voted
WSDM
2009
ACM
15 years 10 months ago
2009
ACM
The ranking function used by search engines to order results is learned from labeled training data. Each training point is a (query, URL) pair that is labeled by a human judge who...