1402 search results - page 80 / 281 » Searching Cycle-Disjoint Graphs |
EKAW
2006
Springer
15 years 1 months ago
2006
Springer
As new semantic web standards evolve to allow quantified rules in FOL, we need new ways to capture them from end users. We show how to do this against a graphic view of entities an...
AIPS
2000
14 years 11 months ago
2000
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
DAWAK
2010
Springer
14 years 11 months ago
2010
Springer
Frequent sub-graph mining entails two significant overheads. The first is concerned with candidate set generation. The second with isomorphism checking. These are also issues with ...
117
click to vote
WAW
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Analysis of aggregate and individual Web requests shows that PageRank is a poor predictor of traffic. We use empirical data to characterize properties of Web traffic not ...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...