Sciweavers

160 search results - page 26 / 32
» Planning Graph Heuristics for Belief Space Search
Sort
View
PVLDB
2010
122views more  PVLDB 2010»
15 years 4 months ago
On Graph Query Optimization in Large Networks
The dramatic proliferation of sophisticated networks has resulted in a growing need for supporting effective querying and mining methods over such large-scale graph-structured da...
Peixiang Zhao, Jiawei Han
WEA
2007
Springer
74views Algorithms» more  WEA 2007»
16 years 4 days ago
Landmark-Based Routing in Dynamic Graphs
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
Daniel Delling, Dorothea Wagner
BIRTHDAY
2006
Springer
15 years 9 months ago
Best-First Rippling
Rippling is a form of rewriting that guides search by only performing steps that reduce the syntactic differences between formulae. Termination is normally ensured by a measure th...
Moa Johansson, Alan Bundy, Lucas Dixon
DASFAA
2008
IEEE
94views Database» more  DASFAA 2008»
15 years 7 months ago
Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination
Recently, great efforts have been dedicated to researches on the management of large-scale graph-based data, where node disjoint subgraph homeomorphism relation between graphs has ...
Yanghua Xiao, Wentao Wu, Wei Wang 0009, Zhenying H...
DLOG
2007
15 years 8 months ago
EXPTIME Tableaux for ALC Using Sound Global Caching
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w...
Rajeev Goré, Linh Anh Nguyen