An effective genetic algorithm for network coding (Q1762065): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Network information flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiple steiner subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information flow decomposition for network coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3547208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to evolutionary computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithms and call admission to telecommunications networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random key based genetic algorithm for the resource constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Random Linear Network Coding Approach to Multicast / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating connected acyclic digraphs uniformly at random / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3634897 / rank
 
Normal rank

Latest revision as of 22:06, 5 July 2024

scientific article
Language Label Description Also known as
English
An effective genetic algorithm for network coding
scientific article

    Statements

    An effective genetic algorithm for network coding (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    network coding
    0 references
    genetic algorithm
    0 references
    resource minimization
    0 references
    heuristic rule
    0 references
    0 references