![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Transactions on Computational Science, Volume 15, 2012
- Marina L. Gavrilova, Chih Jeng Kenneth Tan, Cong-Vinh Phan:
Transactions on Computational Science XV - Special Issue on Advances in Autonomic Computing: Formal Engineering Methods for Nature-Inspired Computing Systems. Lecture Notes in Computer Science 7050, Springer 2012, ISBN 978-3-642-28524-0 - Arun Prakash, Zoltán Theisz, Ranganai Chaparadza:
Formal Methods for Modeling, Refining and Verifying Autonomic Components of Computer Networks. 1-48 - Cem Safak Sahin, M. Ümit Uyar, Stephen Gundry, Elkin Urrea:
Self Organization for Area Coverage Maximization and Energy Conservation in Mobile Ad Hoc Networks. 49-73 - Cong-Vinh Phan
:
Data Intensive Distributed Computing in Data Aware Self-organizing Networks. 74-107 - Pruet Boonma
, Junichi Suzuki:
Accelerated Evolution: A Biologically-Inspired Approach for Augmenting Self-star Properties in Wireless Sensor Networks. 108-129 - Emil Vassev, Serguei A. Mokhov
:
Developing Autonomic Properties for Distributed Pattern-Recognition Systems with ASSL - A Distributed MARF Case Study. 130-157 - Antonio Manzalini, Nermin Brgulja, Corrado Moiso, Roberto Minerva:
Autonomic Nature-Inspired Eco-systems. 158-191 - Sylvain Hallé
, Roger Villemaire, Omar Cherkaoui, Rudy Deca:
A Logical Approach to Data-Aware Automated Sequence Generation. 192-216
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.