Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Bilal H. Abed-Alguni"'
Publikováno v:
Jordanian Journal of Computers and Information Technology, Vol 8, Iss 1, Pp 18-32 (2022)
We live in a world where the Internet has become the backbone of most of our dealings. The Internet has turned this big planet into a small village. The internet can be reached by everyone, everywhere, and anytime. Some authors predict that the numbe
Externí odkaz:
https://doaj.org/article/3cb8e02181ff446ebb267658e8671e20
Autor:
Bilal H. Abed-alguni, Faisal Alkhateeb
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 32, Iss 2, Pp 159-173 (2020)
One of the major problems that is usually associated with any optimization algorithm including the Cuckoo Search (CS) algorithm is the premature convergence to suboptimal solutions. This problem normally occurs when the optimization operators of CS a
Externí odkaz:
https://doaj.org/article/53a17b65e9ed4bb9b9c0d8f208213aa9
Autor:
Bilal H. Abed-alguni, Malek Barhoush
Publikováno v:
Jordanian Journal of Computers and Information Technology, Vol 4, Iss 3, Pp 130-149 (2018)
The Grey Wolf Optimizer (GWO) algorithm is an interesting swarm-based optimization algorithm for global optimization. It was inspired by the hunting strategy and leadership hierarchy of grey wolves. The GWO algorithm has been successfully tailored to
Externí odkaz:
https://doaj.org/article/7ad3d61e4302408a939dc0a27afc64e3
Publikováno v:
Applied Intelligence. 53:13224-13260
This paper proposes new improved binary versions of the Sine Cosine Algorithm (SCA) for the Feature Selection (FS) problem. FS is an essential machine learning and data mining task of choosing a subset of highly discriminating features from noisy, ir
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e8553553d814774fd6d6d61804e34bf5
https://doi.org/10.1007/s10489-022-04201-z
https://doi.org/10.1007/s10489-022-04201-z
Autor:
Bilal H. Abed-alguni, David Paul
Publikováno v:
Soft Computing. 26:3293-3312
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6d545e35d5e2b59fd47211505deaa87
https://doi.org/10.1007/s00500-021-06665-6
https://doi.org/10.1007/s00500-021-06665-6
Publikováno v:
The Journal of Supercomputing. 78:4799-4826
The job shop scheduling problem (JSSP) is a popular NP-hard scheduling problem that simulates the scheduling problems of different real-world applications in fields such as manufacturing, engineering, and planning. In general, many optimization-based
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d592e3ea1c318257805072a454337ac3
https://doi.org/10.1007/s11227-021-04050-6
https://doi.org/10.1007/s11227-021-04050-6
Publikováno v:
The Journal of Supercomputing. 78:3517-3538
The Permutation Flow Shop Scheduling Problem (PFSSP) is an interesting scheduling problem that has many real-world applications. It has been widely used as a benchmark to prove the efficiency of many discrete optimization algorithms. The DJaya algori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be2aacb1dadc7182e4046681785c9e16
https://doi.org/10.1007/s11227-021-03998-9
https://doi.org/10.1007/s11227-021-03998-9
Publikováno v:
Soft Computing. 25:10167-10180
The cuckoo search (CS) algorithm is an effective optimization algorithm, but it is prone to stagnation in suboptimality because of some limitations in its exploration mechanisms. This paper introduces a variation of CS called exploratory CS (ECS), wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b78bb698fda7824eebd850d98129c521
https://doi.org/10.1007/s00500-021-05939-3
https://doi.org/10.1007/s00500-021-05939-3
Publikováno v:
Arabian Journal for Science and Engineering. 46:3213-3233
The optimization-based scheduling algorithms used for scheduling workflows in cloud computing environments may easily get trapped in local optima, especially in the beginning of their simulation processes because of some limitations in their explorat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::53d353dd4f9eab7893ed8b1a47c3cff1
https://doi.org/10.1007/s13369-020-05141-x
https://doi.org/10.1007/s13369-020-05141-x
Autor:
Faisal Alkhateeb, Bilal H. Abed-alguni
Publikováno v:
Journal of King Saud University: Computer and Information Sciences, Vol 32, Iss 2, Pp 159-173 (2020)
One of the major problems that is usually associated with any optimization algorithm including the Cuckoo Search (CS) algorithm is the premature convergence to suboptimal solutions. This problem normally occurs when the optimization operators of CS a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cc8f198b2efde64410e30665d0ba959
https://doi.org/10.1016/j.jksuci.2018.05.003
https://doi.org/10.1016/j.jksuci.2018.05.003