![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
BADS@ICAC 2010: Washington, DC, USA
- Gianluigi Folino, Paraskevi Fragopoulou, Carlo Mastroianni, Junichi Suzuki:
Proceedings of the 2nd Workshop on Bio-Inspired Algorithms for Distributed Systems, BADS '10, Washington, DC, USA, June 11, 2010. ACM 2010, ISBN 978-1-4503-0086-5
Evolutionary techniques for distributed systems
- Weihang Zhu
, Yaohang Li:
GPU-accelerated differential evolutionary Markov Chain Monte Carlo method for multi-objective optimization over continuous space. 1-8 - Leonardo Vanneschi
, Daniele Codecasa, Giancarlo Mauri
:
A study of parallel and distributed particle swarm optimization methods. 9-16
Bio-inspired approaches for P2P and cloud computing
- Kenneth A. De Jong:
Evolutionary computation: challenges for the 21st century. 17-18 - Máté J. Csorba, Hein Meling, Poul E. Heegaard
:
Ant system for service deployment in private and public clouds. 19-28 - Chonho Lee, Junichi Suzuki, Athanasios V. Vasilakos
, Yuji Yamamoto, Katsuya Oba:
An evolutionary game theoretic approach to adaptive and stable application deployment in clouds. 29-38 - Robert N. Lass, Joseph P. Macker, David W. Millar, Ian J. Taylor:
GUMP: adapting client/server messaging protocols into peer-to-peer serverless environments. 39-46 - Cynthia Villalba, Franco Zambonelli
:
Simulation experiences with an ecological approach for pervasive service systems. 47-56
![](https://dblp1.uni-trier.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.