5183 search results - page 290 / 1037 » The Complexity of Distributions |
255
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
184
click to vote
VTC
2010
IEEE
15 years 5 months ago
2010
IEEE
—In this paper, we introduce a collision model for vehicular cluster and we propose path selection algorithms for multi-hop VANETs. That is, we propose the intuitive algorithm na...
162
click to vote
NIPS
2008
15 years 8 months ago
2008
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
156
click to vote
HICSS
2007
IEEE
16 years 29 days ago
2007
IEEE
Critical infrastructures display many of the characteristic properties of complex systems. They exhibit infrequent large failures events that often obey a power law distribution i...
215
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...