47 search results - page 4 / 10 » Phase Transition of Active Rotators in Complex Networks |
ECAL
2007
Springer
14 years 1 months ago
2007
Springer
In this paper1 , we introduce a method, Assortative Preferential Attachment, to grow a scale-free network with a given assortativeness value. Utilizing this method, we investigate ...
PODC
2005
ACM
14 years 28 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...
ICAI
2003
13 years 8 months ago
2003
Boolean satisfiability (SAT) is the canonical NP-complete problem that plays an important role in AI and has many practical applications in Computer Science in general. Boolean n...
CSC
2009
13 years 8 months ago
2009
Small-world networks have become an important model for understanding many complex phenomena in science and in sociological contexts. One tool for exploring the critical and phase...
HIPC
2003
Springer
14 years 17 days ago
2003
Springer
Delay and jitter management in high performance active computation is a challenging problem in the emerging area of internet computing. The problem takes a complex new form from it...