| dc.contributor.author |
Hoang ., A.T |
|
| dc.contributor.author |
Le, V.T. |
|
| dc.contributor.author |
Nguyen, N.G. |
|
| dc.date.accessioned |
2011-05-06T04:19:47Z |
|
| dc.date.available |
2011-05-06T04:19:47Z |
|
| dc.date.issued |
2010 |
|
| dc.identifier.citation |
Page : 232-236 |
vi |
| dc.identifier.isbn |
9.78E+12 |
|
| dc.identifier.uri |
http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/6808 |
|
| dc.description.abstract |
In this paper, we propose a novel approach for the optimal communication spanning tree (OCST)
problem. Our algorithm is based on the Particle Swarm Optimization (PSO) technique and take account into
node biased encoding (NBE) scheme to find nearly optimal solution. The new algorithm can achieve a result
that is better than known heuristic algorithms do, as verified by a set of public benchmark problem
instances. ?? 2010 IEEE. |
vi |
| dc.language.iso |
en |
vi |
| dc.publisher |
2nd International Conference on Communication Software and Networks, ICCSN 2010 |
vi |
| dc.subject |
Optimal communication spanning tree |
vi |
| dc.subject |
Particle Swarm Optimization |
vi |
| dc.subject |
Node biased encoding |
vi |
| dc.title |
A novel particle swarm optimization - Based algorithm for the optimal communication spanning tree problem |
vi |
| dc.type |
Article |
vi |