ITM Web Conf.
Volume 21, 2018Computing in Science and Technology (CST 2018)
|Number of page(s)||8|
|Published online||12 October 2018|
- J. Ladyman, J. Lambert, K. Wiesner, What is a complex system? European Journal for Philosophy of Science, 3(1), 33–67 (2013) [CrossRef] [Google Scholar]
- F. Grabowski, Nonextensive model of self-organizing systems. Complexity, Wiley, 18(5), 28–36 (2013) [Google Scholar]
- G.M. Dimirovski (Ed.), Complex Systems. Relationships between Control, Communications and Computing. Studies in Systems, Decision and Control, 55 (2016) [Google Scholar]
- G. Nicolis, C. Nicolis, Foundations of Complex Systems: Emergence, Information and Predicition (2012) [CrossRef] [Google Scholar]
- F. Grabowski, A. Paszkiewicz, M. Bolanowski, Wireless networks environment and complex networks, Analysis and Simulation of Electrical and Computer Systems, 324, 261–270 (2015) [Google Scholar]
- Z. Gomółka, B. Twaróg, J. Bartman, B. Kwiatkowski, Improvement of Image Processing by Using Homogeneous Neural Networks with Fractional Derivatives Theorem, AIMS, Discrete and Continuous Dynamical Systems, Journal of American Institute of Mathematical Sciences, 505–514 (2011) [Google Scholar]
- T. Pełech-Pilichowski, A hybrid algorithm for detecting changes in diagnostic signals received from technical devices, Proceedings of the Federated Conference on Computer Science and Information Systems, 321–327 (2011) [Google Scholar]
- T. Pełech-Pilichowski, J.T. Duda, A two-level detector of short-term unique changes in time series based on a similarity method, Expert Systems 2015, 32(4), 555–561 (2015) [Google Scholar]
- P. Erdős, A. Rényi, On Random Graphs I, Publicationes Mathematicae, 290–297 (1959) [Google Scholar]
- M.E.J. Newman, Random graphs as models of networks, Santa Fe Institute (2002) [Google Scholar]
- M.E.J. Newman, S. Strogatz, D. Watts, Random graph models of social networks, Proceedings of the National Academy of Sciences of the United States of America, 99, 2566–2572 (2002) [CrossRef] [Google Scholar]
- S.N. Sivanandam, S.N. Deepa, Introduction to Genetic Algorithms, Springer-Verlag Berlin Heidelberg (2008) [Google Scholar]
- G. Siganos, M. Faloutsos, P. Faloutsos, Ch. Faloutsos, Power laws and the AS-level internet topology, IEEE/ACM Transactions on Networking, 11(4), 514–524 (2003) [Google Scholar]
- H. Ebel, L. Mielsch, S. Bornholdt, Scale-free topology of e-mail networks, Physical review E, 66(3) (2002) [Google Scholar]
- S. Redner, Citation Statistics From More Than a Century of Physical Review, Physics Today, 58, 4954 (2005) [Google Scholar]
- R. Albert, A.L. Barabási, Statistical mechanics of complex networks, Review of Modern Physics, 74, 47–91 (2002) [CrossRef] [MathSciNet] [Google Scholar]
- A.L. Barabási, Scale-Free Networks: A Decade and Beyond, Science Magazine, 325, 412–413 (2009) [Google Scholar]
- R. Albert. H. Jeong, A.L. Barabási, Diameter of the world-wide web, Nature, 401, 130–131 (1999) [CrossRef] [Google Scholar]
- L. Muchnik, S. Pei, L.C. Parra, H. Makse, Origins of power-law degree distribution in the heterogeneity of human activity in social networks, Scientific Reports 3, 1783 (2013) [CrossRef] [Google Scholar]
- S. Virinchi, M. Pabitra, Link Prediction in Social Networks: Role of Power Law Distribution, Springer International Publishing (2016) [Google Scholar]
- A.L. Barabasi, E. Bonabeau, Scale-Free Netwroks, Scientific American, 288, 50–59 (2003) [CrossRef] [Google Scholar]
- A. Claus, S. Kratzig, Optimal planning of network structures within an exchange area, European Journal of Operational Research, 7(1), 67–76 (1981) [CrossRef] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.