Sciweavers

250 search results - page 31 / 50
» Stochastic Kronecker Graphs
Sort
View
ASUNAM
2010
IEEE
13 years 11 months ago
Fast Discovery of Reliable Subnetworks
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...
Petteri Hintsanen, Hannu Toivonen, Petteri Sevon
IJCAI
2007
13 years 11 months ago
State Space Search for Risk-Averse Agents
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...
Patrice Perny, Olivier Spanjaard, Louis-Xavier Sto...
ISCAPDCS
2004
13 years 11 months ago
Distributed Algorithms for DCOP: A Graphical-Game-Based Approach
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...
Rajiv T. Maheswaran, Jonathan P. Pearce, Milind Ta...
CORR
2008
Springer
114views Education» more  CORR 2008»
13 years 10 months ago
Network-based consensus averaging with general noisy channels
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...
Ram Rajagopal, Martin J. Wainwright
MOBICOM
2004
ACM
14 years 3 months ago
Analyzing the spread of active worms over VANET
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...
Syed A. Khayam, Hayder Radha