11th International Conference on Parallel and Distributed Systems (ICPADS'05)
DOI: 10.1109/icpads.2005.156
|View full text |Cite
|
Sign up to set email alerts
|

GA-Based Automated Task Assignment on Network Processors

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…There have been prior attempts to use task allocation on a network processor using pipelining [26][27][28]. Shoumeng et al [26] propose a genetic algorithm-based task assignment for network processors.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…There have been prior attempts to use task allocation on a network processor using pipelining [26][27][28]. Shoumeng et al [26] propose a genetic algorithm-based task assignment for network processors.…”
Section: Related Workmentioning
confidence: 99%
“…Shoumeng et al [26] propose a genetic algorithm-based task assignment for network processors. They assign different packet processing tasks to the network processors in a pipelined manner.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…WTA problem also belongs to combinational optimization problem that is NP-hard. Several approaches to solve WTA problem have appeared such as genetic algorithm (GA) (Huai, Jian-Xin, & Chun-mei, 2008;Shoumeng, Xingshe, & Lingmin, 2005;Zhang, Fan, & Li, 2009), ant colony algorithm (ACO), particle swarm algorithm (PSA) (Wei & Wei, 2010) and so on, which can reduce the computational complexity and improve expected accumulated value. However, most of these approaches did not consider the mutual relation of the targets and the adversarial environment in battle.…”
Section: Introductionmentioning
confidence: 99%