5922 search results - page 572 / 1185 » Navigability of Complex Networks |
148
click to vote
NSDI
2004
15 years 8 months ago
2004
Currently, researchers designing and implementing largescale overlay services employ disparate techniques at each stage in the production cycle: design, implementation, experiment...
163
click to vote
UAI
2001
15 years 8 months ago
2001
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Baye...
227
click to vote
ISCAPDCS
2003
15 years 8 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
167
click to vote
UAI
2003
15 years 8 months ago
2003
In this paper, we provide new complexity results for algorithms that learn discrete-variable Bayesian networks from data. Our results apply whenever the learning algorithm uses a ...
185
click to vote
AAAI
1996
15 years 8 months ago
1996
This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent inform...