104 search results - page 2 / 21 » Graph Searching, Elimination Trees, and a Generalization of ... |
AAAI
1990
14 years 11 hour ago
1990
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...
AAAI
2004
14 years 7 days ago
2004
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
ENTCS
2007
13 years 10 months ago
2007
We suggest a formal model to represent and solve the multicast routing problem in multicast networks. To attain this, we model the network adapting it to a weighted and-or graph, ...
CP
2006
Springer
14 years 2 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
KDD
2003
ACM
14 years 11 months ago
2003
ACM
A commercial Web page typically contains many information blocks. Apart from the main content blocks, it usually has such blocks as navigation panels, copyright and privacy notice...