z-logo
open-access-imgOpen Access
M-Unit EigenAnt: An Ant Algorithm to Find the M Best Solutions
Author(s) -
Sameena Shah,
Jayadeva Jayadeva,
Ravi Kothari,
Suresh Chandra
Publication year - 2011
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v25i1.7877
Subject(s) - shortest path problem , path (computing) , computer science , convergence (economics) , mathematical optimization , ant colony optimization algorithms , selection (genetic algorithm) , local optimum , ant colony , asymptotically optimal algorithm , foraging , algorithm , mathematics , artificial intelligence , theoretical computer science , ecology , graph , economics , programming language , economic growth , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom