Sciweavers

1376 search results - page 111 / 276
» Searching Trees: An Essay
Sort
View
AAAI
1990
15 years 7 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...
ICAS
2005
IEEE
109views Robotics» more  ICAS 2005»
16 years 1 days ago
Proactive Route Maintenance and Overhead Reduction for Application Layer Multicast
— The purpose of this study is to maintain efficient backup routes for restoring overlay trees. In most conventional methods, after a node leaves the trees, its children start se...
Tetsuya Kusumoto, Yohei Kunichika, Jiro Katto, Sak...
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
15 years 10 months ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya
WWW
2008
ACM
16 years 7 months ago
Recommending questions using the mdl-based tree cut model
The paper is concerned with the problem of question recommendation. Specifically, given a question as query, we are to retrieve and rank other questions according to their likelih...
Yunbo Cao, Huizhong Duan, Chin-Yew Lin, Yong Yu, H...
WSC
2008
15 years 8 months ago
The improved sweep metaheuristic for simulation optimization and application to job shop scheduling
We present an improved sweep metaheuristic for discrete event simulation optimization. The sweep algorithm is a tree search similar to beam search. The basic idea is to run a limi...
George Jiri Mejtsky