Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Ant algorithms"”.

  1. Routing und Adressierung in mobilen multi-hop Ad-hoc-Netzen

    … over radio. These networks have an important advantage; they do not require any existing infrastructure or central administration. Two nodes can communicate together as soon as they are in communication range. Two nodes apart from each other need the help of intermediate nodes relay their …

    aachen Repository record for Routing und Adressierung in mobilen multi-hop Ad-hoc-Netzen (opens in a new tab)

  2. A more robust ant colony learning algorithm : with application to travelling salesman problem

    … model many real life applications, where the quantity of the nodes often changes with time. In such graphs, the evaluation of shortest tour is important as various guiding and navigation systems use this information. Nodes of a graph, in many applications, often change over time, and evaluation …

    unm Repository record for A more robust ant colony learning algorithm : with application to travelling salesman problem (opens in a new tab)