5114 search results - page 436 / 1023 » Complex networks |
122
click to vote
UAI
2001
15 years 6 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...
169
Voted
ISCAPDCS
2003
15 years 6 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...
137
click to vote
AAAI
1996
15 years 6 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...
145
Voted
CCGRID
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
124
click to vote
EOR
2008
15 years 4 months ago
2008
In Multi-Protocol Label Switching (MPLS) networks, traffic demands can be routed along tunnels called Label Switched Paths (LSPs). A tunnel is characterized by a path in the netwo...