5922 search results - page 555 / 1185 » Navigability of Complex Networks |
194
click to vote
ICLP
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. Reasoning about social networks (labeled, directed, weighted graphs) is becoming increasingly important and there are now models of how certain phenomena (e.g. adoption o...
158
click to vote
EUROPAR
2006
Springer
15 years 10 months ago
2006
Springer
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
176
click to vote
CHARME
1997
Springer
15 years 10 months ago
1997
Springer
Formal verification techniques need to deal with the complexity of the systems rified. Most often, this problem is solved by taking an abstract model of the system and aiming at a...
199
click to vote
DSN
2009
IEEE
15 years 10 months ago
2009
IEEE
The dependability of overlay services rely on the overlay network’s capabilities to effectively diagnose and recover faults (e.g., link failures, overlay node outages). However,...
196
click to vote
AAAI
2008
15 years 9 months ago
2008
Markov logic networks (MLNs) combine first-order logic and Markov networks, allowing us to handle the complexity and uncertainty of real-world problems in a single consistent fram...