Competing Ants for Organization Detection Application to Dynamic Distribution

DOI10.1007/3-540-34824-7_2MaRDI QIDQ3424933zbMATH OpenOpenAlexFDO

Authors Alain Cardon, Antoine Dutot, Frédéric Guinand, Damien Olivier

Publication date 5 March 2007

Published in Understanding Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-34824-7_2

Mathematics Subject Classification ID

Applications of graph theory (05C90) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A distributed multilevel ant colonies approach
• scientific article; zbMATH DE number 1900792
• Ant algorithms: theory and applications
• Distributed house-hunting in ant colonies
• Ant-Inspired Dynamic Task Allocation via Gossiping

Cited in

(2)

• Self-organized criticality in ant brood tending
• Two-category model of task allocation with application to ant societies

This page was built for publication: Competing Ants for Organization Detection Application to Dynamic Distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424933)