We consider algorithms for combining advice from a set of experts. In each trial, the algorithm receives the predictions of the experts and produces its own prediction. A loss func...
Abstract. Using a knowledge-based approach we adjust a knowledgebased algorithm for multi-agent communication for the process of cooperative problem solving (CPS). The knowledge-ba...
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
Abstract. In modern parallel and distributed systems, the time for exchanging data is usually larger than that for computing elementary operations. Consequently, these communicatio...
Johnatan E. Pecero, Denis Trystram, Albert Y. Zoma...
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve ...