450 search results - page 34 / 90 » Local Search with Congestion in Complex Communication Networ... |
UAI
2001
14 years 11 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...
IPSN
2005
Springer
15 years 3 months ago
2005
Springer
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
MMB
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
CCGRID
2010
IEEE
14 years 11 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...
ICC
2000
IEEE
15 years 1 months ago
2000
IEEE
The logical configuration of a WDM network can be changed by reassigning wavelengths to tunable transceivers of nodes. In this paper, we develop reconfiguration algorithms to obtai...