![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Agent-Based Optimization 2013
- Ireneusz Czarnowski, Piotr Jedrzejowicz, Janusz Kacprzyk:
Agent-Based Optimization. Studies in Computational Intelligence 456, Springer 2013, ISBN 978-3-642-34096-3 - Ireneusz Czarnowski, Piotr Jedrzejowicz:
Machine Learning and Multiagent Systems as Interrelated Technologies. 1-28 - Mariusz Boryczka, Wojciech Bura:
Ant Colony Optimization for the Multi-criteria Vehicle Navigation Problem. 29-53 - Dariusz Barbucha
:
Solving Instances of the Capacitated Vehicle Routing Problem Using Multi-agent Non-distributed and Distributed Environment. 55-75 - Piotr Jedrzejowicz, Aleksander Skakovski:
Structure vs. Efficiency of the Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation. 77-102 - Piotr Jedrzejowicz, Ewa Ratajczak-Ropel
:
Triple-Action Agents Solving the MRCPSP/Max Problem. 103-122 - Dariusz Barbucha
, Ireneusz Czarnowski, Piotr Jedrzejowicz, Ewa Ratajczak-Ropel
, Izabela Wierzbowska:
Team of A-Teams - A Study of the Cooperation between Program Agents Solving Difficult Optimization Problems. 123-141 - Kunal Srivastava, Angelia Nedic
, Dusan M. Stipanovic
:
Distributed Bregman-Distance Algorithms for Min-Max Optimization. 143-174 - Anand J. Kulkarni
, Kang Tai
:
A Probability Collectives Approach for Multi-Agent Distributed and Cooperative Optimization with Tolerance for Agent Failure. 175-201
![](https://dblp.org/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.