Sciweavers

88 search results - page 9 / 18
» Multicast Routing Based on Genetic Algorithms
Sort
View
ICC
2007
IEEE
15 years 4 months ago
Optimal Distributed Multicast Routing using Network Coding
—Multicast is an important communication paradigm, also a problem well known for its difficulty (NP-completeness) to achieve certain optimization goals, such as minimum network ...
Yi Cui, Yuan Xue, Klara Nahrstedt
IPPS
2005
IEEE
15 years 3 months ago
A Novel QoS Multicast Model in Mobile Ad Hoc Networks
Multicast applications for large-scale Mobile Ad hoc NETworks (MANETs) require an efficient and effective Quality of Service (QoS)-aware multicast model. The new requirements to ...
Guojun Wang, Jiannong Cao, Lifan Zhang, Keith C. C...
TEC
2002
117views more  TEC 2002»
14 years 9 months ago
A genetic algorithm for shortest path routing problem and the sizing of populations
This paper presents a genetic algorithmic approach to the shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for ...
Chang Wook Ahn, Rudrapatna S. Ramakrishna
GECCO
2005
Springer
139views Optimization» more  GECCO 2005»
15 years 3 months ago
A genetic algorithm for unmanned aerial vehicle routing
Genetic Algorithms (GAs) can efficiently produce high quality results for hard combinatorial real world problems such as the Vehicle Routing Problem (VRP). Genetic Vehicle Represe...
Matthew A. Russell, Gary B. Lamont
GECCO
2005
Springer
156views Optimization» more  GECCO 2005»
15 years 3 months ago
The blob code is competitive with edge-sets in genetic algorithms for the minimum routing cost spanning tree problem
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
Bryant A. Julstrom