3122 search results - page 311 / 625 » A Theory of Network Equivalence |
174
Voted
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
145
click to vote
DAI
1995
Springer
15 years 10 months ago
1995
Springer
In response to the problems that have arisen regarding the terminology and concepts of agent-oriented systems, previous work has described a formal framework for understanding agen...
189
click to vote
DIALM
2010
ACM
15 years 4 months ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
157
click to vote
SAGT
2009
Springer
16 years 1 months ago
2009
Springer
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
166
click to vote
PODC
2005
ACM
16 years 8 days ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...