矛盾
发表于 2025-3-25 04:29:31
Computational Aspects of Attack–Defense Treesy representing interactions between possible attacks and corresponding defensive measures. In this paper we compare the computational complexity of both formalisms. We identify semantics for which extending attack trees with defense nodes does not increase the computational complexity. This implies
不自然
发表于 2025-3-25 08:15:11
http://reply.papertrans.cn/87/8635/863467/863467_22.png
Indent
发表于 2025-3-25 15:32:17
Model Selection in Logistic Regression Using p-Values and Greedy Search and scaling constants are satisfied and the search is performed over the family of all submodels. Moreover, we investigate practical performance of the introduced criteria in conjunction with greedy search methods such as initial ordering, forward and backward search and genetic algorithm which res
impale
发表于 2025-3-25 16:11:31
http://reply.papertrans.cn/87/8635/863467/863467_24.png
有特色
发表于 2025-3-25 21:38:02
Multi-Test Decision Trees for Gene Expression Data Analysisthe performance of decision trees under a possibly small increase in their complexity. Our approach is thus based on univariate tests, and the main contribution of this paper is the application of several univariate tests in each non-terminal node of the tree. In this way, obtained trees are still r
filicide
发表于 2025-3-26 01:31:08
Rule-Based Approach to Computational Stylisticsneed as few constituent decision rules as possible, when their number is too low it may lead to a poor performance of the classifier. The decision rules can be found by providing the minimal cover of the training samples, by calculating rules with some genetic algorithms, by the exhaustive search fo
reject
发表于 2025-3-26 04:53:22
http://reply.papertrans.cn/87/8635/863467/863467_27.png
乞丐
发表于 2025-3-26 10:20:52
Towards an OpenCL Implementation of Genetic Algorithms on GPUs obtained by turning parallel depends on the choice of the selection methods used in GA. In particular the simple tournament selection method yields better results than the selection based on the roulette rule. In case of the latter which requires a synchronization of threads which manipulate indivi
mechanical
发表于 2025-3-26 12:39:41
Evolutionary Algorithm Parameter Tuning with Sensitivity Analysise proposed work focuses on its application to a Parallel Asynchronous Cellular Genetic Algorithm (PA-CGA). Experimental results on two different instances of a scheduling problem have demonstrated that some metaheuristic parameters values have little influence on the solution quality. On the opposit
Prosaic
发表于 2025-3-26 17:51:02
http://reply.papertrans.cn/87/8635/863467/863467_30.png