Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Fang'an Deng"'
Publikováno v:
PLoS ONE, Vol 12, Iss 4, p e0175114 (2017)
Harmony Search (HS) and Teaching-Learning-Based Optimization (TLBO) as new swarm intelligent optimization algorithms have received much attention in recent years. Both of them have shown outstanding performance for solving NP-Hard optimization proble
Externí odkaz:
https://doaj.org/article/153e98130f8e4405b21cf6def14290a8
Publikováno v:
The Scientific World Journal, Vol 2014 (2014)
To enhance the performance of harmony search (HS) algorithm on solving the discrete optimization problems, this paper proposes a novel harmony search algorithm based on teaching-learning (HSTL) strategies to solve 0-1 knapsack problems. In the HSTL a
Externí odkaz:
https://doaj.org/article/ed14a3deba1448ceacb5b8268618d353
Publikováno v:
Algebra. 2016:1-7
The so-called ideal and subalgebra and some additional concepts of N(2,2,0) algebras are discussed. A partial order and congruence relations on N(2,2,0) algebras are also proposed, and some properties are investigated.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a705c1ec44d26cabf99bcac58c35a405
https://doi.org/10.1155/2016/2752681
https://doi.org/10.1155/2016/2752681
Autor:
Fang'an Deng, Longquan Yong, Xiguo Yuan, Junying Zhang, Shouheng Tuo, Baobao Liu, Xiaoyang Xu
Publikováno v:
Digital Signal Processing. 46:151-163
DDRA strategy for avoiding generating invalid solutions.Dynamic fret width (fw) strategy of two phases for balance global exploration and local exploitation.DIHS algorithm for improving the solution quality and search efficiency.Take-one strategy for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::93b94b121a686f688577c6723efa97a5
https://doi.org/10.1016/j.dsp.2015.08.008
https://doi.org/10.1016/j.dsp.2015.08.008
Publikováno v:
PLoS ONE, Vol 12, Iss 4, p e0175114 (2017)
PLoS ONE
PLoS ONE
Harmony Search (HS) and Teaching-Learning-Based Optimization (TLBO) as new swarm intelligent optimization algorithms have received much attention in recent years. Both of them have shown outstanding performance for solving NP-Hard optimization proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::079a47f1e69d3385560db3fdabf66d71
http://europepmc.org/articles/PMC5389630?pdf=render
http://europepmc.org/articles/PMC5389630?pdf=render
Publikováno v:
Quantitative Logic and Soft Computing 2016 ISBN: 9783319462059
In this paper, we introduce a subalgebra of N(2, 2, 0)-algebras, investigate the relations between N(2, 2, 0)-algebras and other algebras, such as G-algebra, B-algebra, Q-algebra and CI-algebra. In particular, we find out a class of subalgebras of N(
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2de03068a3bffde1f590b737373b7e3c
https://doi.org/10.1007/978-3-319-46206-6_41
https://doi.org/10.1007/978-3-319-46206-6_41
Publikováno v:
Mathematical Problems in Engineering, Vol 2015 (2015)
The construction example of algebra system is to verify the existence of a complex algebra system, and it is a NP-hard problem. In this paper, to solve this kind of problems, firstly, a mathematical optimization model for construction example of alge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51ecae7626079decf54442c5273833ab
https://doaj.org/article/453a40a662104f82b3e3a44dbdaae5eb
https://doaj.org/article/453a40a662104f82b3e3a44dbdaae5eb
Publikováno v:
2011 Fourth International Conference on Information and Computing.
A feasible interior point method is proposed for solving the NP-hard absolute value equation (AVE) when the singular values of A exceed one. We formulate the NP-hard AVE as linear complementary problem, and prove that the solution to AVE is existent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3a49e56bb5f7d6c1c5789ed5d190849
https://doi.org/10.1109/icic.2011.65
https://doi.org/10.1109/icic.2011.65
Publikováno v:
2010 IEEE International Conference on Progress in Informatics and Computing.
An iterative method for solving a class of nonnegative linear least squares problems is presented. Firstly, nonnegative least squares problem is transformed into monotone linear complementarity problem. Then we present an iterative algorithm for mono
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6a21c8504d148be810df0c25554cc7c
https://doi.org/10.1109/pic.2010.5687990
https://doi.org/10.1109/pic.2010.5687990
Publikováno v:
Rough Sets and Knowledge Technology ISBN: 9783540797203
RSKT
RSKT
By means of analyzing kernel clustering algorithm and rough set theory, a novel clustering algorithm, rough kernel k-means clustering algorithm, was proposed for clustering analysis. Through using Mercer kernel functions, samples in the original spac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::307fd1085afd2ff0c5957d5ff9303fdd
https://doi.org/10.1007/978-3-540-79721-0_27
https://doi.org/10.1007/978-3-540-79721-0_27