250 search results - page 31 / 50 » Stochastic Kronecker Graphs |
134
click to vote
ASUNAM
2010
IEEE
15 years 7 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
139
click to vote
IJCAI
2007
15 years 7 months ago
2007
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
144
click to vote
ISCAPDCS
2004
15 years 6 months ago
2004
This paper addresses the application of distributed constraint optimization problems (DCOPs) to large-scale dynamic environments. We introduce a decomposition of DCOP into a graph...
141
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
167
click to vote
MOBICOM
2004
ACM
15 years 11 months ago
2004
ACM
Interactive communications among nodes in Vehicular Ad Hoc Networks (VANET) and the safety-oriented nature of many VANET applications necessitate a robust security framework. An a...