2022
DOI: 10.1007/s10845-022-02032-w
|View full text |Cite
|
Sign up to set email alerts
|

Particle swarm optimization service composition algorithm based on prior knowledge

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(7 citation statements)
references
References 41 publications
0
7
0
Order By: Relevance
“…Table 1 lists the response time of TFTCs measured by other groups. [ 21–27 ] From Table 1, it can be seen that without the memory hicorder, the response time of TFTCs could be reflected in the range of 10 0 –10 2 µs. Only with memory hicorder, the response time of TFTCs could be accurately reflected in the range of 10 1 –10 2 ns, because the memory hicorder could record TEF signal with microvolt and nanosecond accuracy, simultaneously.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Table 1 lists the response time of TFTCs measured by other groups. [ 21–27 ] From Table 1, it can be seen that without the memory hicorder, the response time of TFTCs could be reflected in the range of 10 0 –10 2 µs. Only with memory hicorder, the response time of TFTCs could be accurately reflected in the range of 10 1 –10 2 ns, because the memory hicorder could record TEF signal with microvolt and nanosecond accuracy, simultaneously.…”
Section: Resultsmentioning
confidence: 99%
“…[ 19,20 ] For example, with traditional voltmeter and oscilloscopes, many research teams reported the dynamic response time of TFTCs in several milliseconds. [ 21–27 ] So, without the accurate dynamic calibration procedure, TFTCs are restricted in some fields with quick response, such as aeronautics, space, nuclear energy, and so on. Fortunately, the memory hicorder could record TEF signal with microvolt and nanosecond accuracy, simultaneously.…”
Section: Introductionmentioning
confidence: 99%
“…An approximate approach for the neighborhood search of ABC was developed, which enables effective local search in the discrete space of service selection in a way that is analogical to the search in a continuous space. In order to quickly find an appropriate composition of services that meet the individual user's requirements in the Internet big data, Wang et al [33] proposed an improved particle swarm service composition method based on prior knowledge. This improved particle swarm algorithm has a mechanism to escape from the local optima.…”
Section: )mentioning
confidence: 99%
“… Genetic Algorithm (GA) [ 36 ]: this algorithm adopts a binary problem encoding approach, with the number of dimensions corresponding to the available configuration types. Particle Swarm Optimization (PSO) [ 37 ]: Similar to DE, PSO faces challenges in solving discrete problems; to address this, we apply PSO to the problem by taking the residuals. …”
Section: Experimenal Evaluationmentioning
confidence: 99%
“…Particle Swarm Optimization (PSO) [ 37 ]: Similar to DE, PSO faces challenges in solving discrete problems; to address this, we apply PSO to the problem by taking the residuals.…”
Section: Experimenal Evaluationmentioning
confidence: 99%