Multiple Heterogeneous Ant Colonies with Information Exchange
Publications associées (54)
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Natural and artificial societies often divide the workload between specialized members. For example, an ant worker may preferentially perform one of many tasks such as brood rearing, foraging and nest maintenance. A robot from a rescue team may specialize ...
This paper presents the first probabilistic Byzantine Agreement algorithm whose communication and time complexities are poly-logarithmic. So far, the most effective probabilistic Byzantine Agreement algorithm had communication complexity and time complexit ...
Group food retrieval in some ant species serves as a useful paradigm for multirobot collective transport strategies that are decentralized, scalable, and do not require a priori information about the payload. We present a comprehensive overview of group re ...
To meet strict requirements of the information society technologies, antennas and circuit elements are becoming increasingly complex. Frequently, their electromagnetic (EM) properties cannot be anymore expressed in closed-form analytical expressions mainly ...
In games, the goals and interests of players are key factors in their behavior. However, techniques used by networked games to cope with infrequent updates and message loss, such as dead reckoning, estimate a player's movements based mainly on previous obs ...
Particle Swarm Optimization is a simple and elegant optimization algorithm used to solve a large variety of different real-valued problems. When it comes to solving combinations of continuous and discrete problems however, PSO by itself is not very well su ...
Many algorithms have recently been proposed for finding communities in networks. By definition, a community is a subset of vertices with a high number of connections among the vertices, but only few connections with other vertices. The worst drawback of mo ...
In conventional vector space model for information retrieval, query vector generation is imperfect for retrieval of precise documents which are de-sired by user. In this paper, we present a stochastic based approach for optimiz-ing query vector without use ...
This paper proposes a distributed resource assignment strategy for cognitive networks mimicking a swarm foraging mechanism, assuming that the communication among the cognitive nodes is impaired by random link failures and quantization noise. Using results ...
Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key buildi ...
