Sciweavers

1402 search results - page 203 / 281
» Sparse-Memory Graph Search
Sort
View
ICDE
2010
IEEE
240views Database» more  ICDE 2010»
15 years 6 months ago
Top-K aggregation queries over large networks
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
Xifeng Yan, Bin He, Feida Zhu, Jiawei Han
105
Voted
AAAI
2006
15 years 4 months ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar
130
Voted
AAAI
1990
15 years 3 months ago
Symbolic Probabilistic Inference in Belief Networks
The Symbolic Probabilistic Inference (SPI) Algorithm [D'Ambrosio, 19891 provides an efficient framework for resolving general queries on a belief network. It applies the conc...
Ross D. Shachter, Bruce D'Ambrosio, Brendan Del Fa...
151
Voted
CEC
2011
IEEE
14 years 2 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
HT
1997
ACM
15 years 6 months ago
Collective Phenomena in Hypertext Networks
A large hypertext net with node-to-node links can be interesting as a system of unities of meaning formed by node clusters, such that nodes in each of them are orderable into a co...
Valery M. Chelnokov, Victoria L. Zephyrova