Zobrazeno 1 - 10
of 139
pro vyhledávání: '"Principal variation search"'
Publikováno v:
2020 Chinese Control And Decision Conference (CCDC).
Connect6 is an intuitive and fair game with no first-hand advantage. Because of the large search tree, the search depth is often lower, to sacrifice strength of chess to improve search efficiency. In this case, this paper proposes an optimization alg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::19262472188f69a4428996b9c6d51b41
https://doi.org/10.1109/ccdc49329.2020.9163922
https://doi.org/10.1109/ccdc49329.2020.9163922
Autor:
Werda Buana Putra, Lukman Heryawan
Publikováno v:
Jurnal Teknosains: Jurnal Ilmiah Sains dan Teknologi, Vol 6, Iss 1, Pp 37-43 (2017)
Jurnal Teknosains; Vol 6, No 1 (2016): December; 37-43
Jurnal Teknosains; Vol 6, No 1 (2016): December; 37-43
Minimax Algorithm, is a solution to reduce the burden on hardware in chess engine. However, a more in-depth method is needed to further increase the search algorithm. One of those solutions is called Alpha-Beta Pruning algorithm. The idea is to elimi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::559eaf7cca166a5d94b2e6d006719859
https://jurnal.ugm.ac.id/teknosains/article/view/11380
https://jurnal.ugm.ac.id/teknosains/article/view/11380
Publikováno v:
Computational Statistics & Data Analysis. 106:90-102
Tree-based methods are a non-parametric modelling strategy that can be used in combination with generalized linear models or Cox proportional hazards models, mostly at an exploratory stage. Their popularity is mainly due to the simplicity of the tech
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::71a40aa34522fd12bead3aed0079ebb4
https://doi.org/10.1016/j.csda.2016.08.011
https://doi.org/10.1016/j.csda.2016.08.011
Publikováno v:
Computer Speech & Language. 41:146-160
Entropy-based pruning has a limit in selecting a fine distribution of phrase pairs to be pruned in a threshold.Changing the distribution through other divergence metrics improves pruning efficiency in our preliminary empirical analysis.Derived proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af2ccbccdbc8418d70bb84733edd78d0
https://doi.org/10.1016/j.csl.2016.06.006
https://doi.org/10.1016/j.csl.2016.06.006
Publikováno v:
KES
Learning from imbalanced data is attracting an increasing interest by the machine learning community. This is mainly due to the high number of real applications that are affected by this situation. The adaptation of the standard decision trees to dea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1506eeb47a6836489a49deb90d79f2d7
https://doi.org/10.1016/j.procs.2017.08.060
https://doi.org/10.1016/j.procs.2017.08.060
Publikováno v:
IEEE Transactions on Computers. 65:2059-2073
Branch-and-bound approaches are promising in pruning fruitless search space during the resource constrained scheduling. However, such approaches only compare the estimated upper and lower bounds of an incomplete schedule to the length of the best fea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7f456f489b0a313d572d191d84d150a4
https://doi.org/10.1109/tc.2015.2468230
https://doi.org/10.1109/tc.2015.2468230
Autor:
Yang Lou, Shiu Yin Yuen
Publikováno v:
Memetic Computing. 8:189-210
The continuous non-revisiting genetic algorithm (cNrGA) uses the entire search history and parameter-less adaptive mutation to significantly enhance search performance. Storing the entire search history is natural and costs little when the number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1820fb7018ab36a99a4eb0c1b9ca531e
https://doi.org/10.1007/s12293-015-0178-6
https://doi.org/10.1007/s12293-015-0178-6
Autor:
Xiaomeng Han, Qun Dai
Publikováno v:
Applied Intelligence. 44:816-830
Although ordering-based pruning algorithms possess relatively high efficiency, there remains room for further improvement. To this end, this paper describes the combination of a dynamic programming technique with the ensemble-pruning problem. We inco
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3bbdf70276f4d357372e505963d7bd85
https://doi.org/10.1007/s10489-015-0729-z
https://doi.org/10.1007/s10489-015-0729-z
Autor:
G Ravi Prakash, Kiran M
Publikováno v:
International Journal of Computer Applications. 125:41-48
intention of MapReduce Sets for Pruning Decomposition expressions analysis has to suggest criteria how Pruning Decomposition expressions in Pruning Decomposition data can be defined in a meaningful way and how they should be compared. Similitude base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56700d3e1a69187f096d417e58ca3af2
https://doi.org/10.5120/ijca2015906155
https://doi.org/10.5120/ijca2015906155
Autor:
Rutvija Pandya, Jayati Pandya
Publikováno v:
International Journal of Computer Applications. 117:18-21
Data mining is a knowledge discovery process that analyzes data and generate useful pattern from it. Classification is the technique that uses pre-classified examples to classify the required results. Decision tree is used to model classification pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f781aa6ac75170b2e23aac34ed54c0d4
https://doi.org/10.5120/20639-3318
https://doi.org/10.5120/20639-3318