作者: delegate 時(shí)間: 2025-3-21 21:56 作者: certain 時(shí)間: 2025-3-22 00:49 作者: intricacy 時(shí)間: 2025-3-22 05:56 作者: harmony 時(shí)間: 2025-3-22 11:19 作者: Anticlimax 時(shí)間: 2025-3-22 16:44 作者: Anticlimax 時(shí)間: 2025-3-22 18:47
802.11 De-authentication Attack Detection Using Genetic Programming – 100 percent detection rate and 0.5 percent false positive rate – but also developed a solution that is general enough to detect similar attacks, such as disassociation attacks, that were not present in the training data.作者: DEFER 時(shí)間: 2025-3-22 21:46 作者: 在前面 時(shí)間: 2025-3-23 01:47 作者: 過(guò)度 時(shí)間: 2025-3-23 05:38 作者: Leaven 時(shí)間: 2025-3-23 10:51 作者: Chameleon 時(shí)間: 2025-3-23 16:23
https://doi.org/10.1007/978-3-642-71980-6presentation, efficient GP operators are introduced that allow efficient and fast evolution, as witnessed by the results on two construction problems that demonstrate that the proposed approach is able to achieve both compactness and reusability of evolved components.作者: hegemony 時(shí)間: 2025-3-23 19:15
https://doi.org/10.1007/978-3-663-14655-1parison between crossover and mutation variation operators, and also undirected random search. We found that the evolutionary algorithms performed much better than undirected random search, and thats mutation outperformed crossover on most problems.作者: avulsion 時(shí)間: 2025-3-24 01:58 作者: palliate 時(shí)間: 2025-3-24 05:29
Zwei postkommunistische Parteien und Europagorithm incorporated by Incentive method. Experimental results are compared with results from a penalty method and from a non-constraint setting. Statistic analysis suggests that Incentive Method is more effective than the other two techniques for this specific problem.作者: Bricklayer 時(shí)間: 2025-3-24 08:45
Die Wissenschaften der Lebensverl?ngerungg salesman problem. Results show that the concept can be used to solve hard problems of big size reliably achieving comparably good or better results than classical evolutionary algorithms and other selected methods.作者: SUGAR 時(shí)間: 2025-3-24 14:04
Incentive Method to Handle Constraints in Evolutionary Algorithms with a Case Studygorithm incorporated by Incentive method. Experimental results are compared with results from a penalty method and from a non-constraint setting. Statistic analysis suggests that Incentive Method is more effective than the other two techniques for this specific problem.作者: 他日關(guān)稅重重 時(shí)間: 2025-3-24 18:32
Iterative Prototype Optimisation with Evolved Improvement Stepsg salesman problem. Results show that the concept can be used to solve hard problems of big size reliably achieving comparably good or better results than classical evolutionary algorithms and other selected methods.作者: echnic 時(shí)間: 2025-3-24 22:37 作者: 責(zé)難 時(shí)間: 2025-3-25 01:00
https://doi.org/10.1007/978-3-8349-3530-4series and on the Arosa Ozone time series. The results show that the method is effective in obtaining the analytical expression of the first two problems, and in achieving a very good approximation and forecasting of the third.作者: cortisol 時(shí)間: 2025-3-25 04:32 作者: 令人發(fā)膩 時(shí)間: 2025-3-25 09:25
Das evolution?re Führungsmodell that iterates the filters classification phase while giving them access to a memory of their previous decisions. These iterative filters achieve superior results and are compared to a set of other methods.作者: 厚臉皮 時(shí)間: 2025-3-25 14:16 作者: 民間傳說(shuō) 時(shí)間: 2025-3-25 17:48
A Divide & Conquer Strategy for Improving Efficiency and Probability of Success in Genetic Programmi. We benchmarked our proposal on three problem domains widely used in the literature. Our results show a significant improvement of the likelihood of success while requiring less computational resources than the standard algorithm.作者: 確定無(wú)疑 時(shí)間: 2025-3-25 22:55
A Genetic Programming Approach to Solomonoff’s Probabilistic Inductionseries and on the Arosa Ozone time series. The results show that the method is effective in obtaining the analytical expression of the first two problems, and in achieving a very good approximation and forecasting of the third.作者: collagenase 時(shí)間: 2025-3-26 01:01 作者: rheumatism 時(shí)間: 2025-3-26 08:23
Iterative Filter Generation Using Genetic Programming that iterates the filters classification phase while giving them access to a memory of their previous decisions. These iterative filters achieve superior results and are compared to a set of other methods.作者: SPASM 時(shí)間: 2025-3-26 11:09
Population Clustering in Genetic Programmingd to solve a symbolic regression problem, a binary classification problem, and a multi-class classification problem. The experiment results show that the new GP system significantly outperforms the standard GP system on these problems.作者: 大氣層 時(shí)間: 2025-3-26 13:55
978-3-540-33143-8Springer-Verlag Berlin Heidelberg 2006作者: MAIM 時(shí)間: 2025-3-26 18:14
Genetic Programming978-3-540-33144-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 接觸 時(shí)間: 2025-3-26 22:10
0302-9743 Overview: 978-3-540-33143-8978-3-540-33144-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 進(jìn)入 時(shí)間: 2025-3-27 04:50
Das endokrine System und die Zwischenzellenocus on developing an appropriate fitness function and feature set. Results show that the intrusion system developed not only performs incredibly well – 100 percent detection rate and 0.5 percent false positive rate – but also developed a solution that is general enough to detect similar attacks, su作者: florid 時(shí)間: 2025-3-27 08:49 作者: outset 時(shí)間: 2025-3-27 12:37
https://doi.org/10.1007/978-3-8349-3530-4given phenomenon. Unfortunately, this operator is not algorithmically computable. The present paper deals with a Genetic Programming approach to Inductive Inference, with reference to Solomonoff’s algorithmic probability theory, that consists in evolving a population of mathematical expressions look作者: Redundant 時(shí)間: 2025-3-27 16:52
Ulrich Jordan,Birgit Külpp,Ines Bruckscheneasons for its destructiveness is its disrespect for the context of swapped subtrees in their respective parent trees when creating offspring. At times, this hampers GP’s performance considerably, and results in populations with . average fitness values..Many attempts have been made to make it a mor作者: Fabric 時(shí)間: 2025-3-27 20:14
https://doi.org/10.1007/978-3-642-86046-1ement System. For some queries it may be possible to derive a similar result set using an approximate query answering algorithm or tool when the . results are not required. Query approximation becomes useful when the following conditions are true: (a) a high percentage of the relevant data is retrie作者: 豪華 時(shí)間: 2025-3-28 02:00 作者: cacophony 時(shí)間: 2025-3-28 03:13 作者: 值得贊賞 時(shí)間: 2025-3-28 10:17 作者: 預(yù)測(cè) 時(shí)間: 2025-3-28 11:33 作者: 祝賀 時(shí)間: 2025-3-28 15:28
https://doi.org/10.1007/978-3-476-03204-1nce of models from a limited number of samples. This paper is an investigation on two methods to improve generalization in GP-based learning: 1) the selection of the best-of-run individuals using a three data sets methodology, and 2) the application of parsimony pressure in order to reduce the compl作者: Maximize 時(shí)間: 2025-3-28 19:29 作者: 水土 時(shí)間: 2025-3-29 02:50 作者: 開(kāi)始從未 時(shí)間: 2025-3-29 03:42
Das evolution?re Führungsmodells could have an influence on watery fauna’s demography. Up to now, identification of retentive hydro-dynamical structures on stream maps has been performed by experts using background knowledge about the area. We tackle this task with filters induced by Genetic Programming, a technique that has alre作者: arbiter 時(shí)間: 2025-3-29 09:48 作者: pus840 時(shí)間: 2025-3-29 11:27 作者: Firefly 時(shí)間: 2025-3-29 16:38 作者: galley 時(shí)間: 2025-3-29 20:39
,Ionisierung. Elektrizit?tsleitung,oach, the whole population is first clustered by a heuristic called fitness-case-equivalence. Then a cluster representative is selected for each cluster. The fitness value of the representative is calculated on all training cases. The fitness is then directly assigned to other members in the same cl作者: 職業(yè)拳擊手 時(shí)間: 2025-3-30 01:08
https://doi.org/10.1007/978-3-322-96287-4per, we present a CI method based in Genetic Programming (GP). This method is able to evolve projections that transform the dataset, constructing a new coordinates space in which the data can be more easily predicted. This coordinates space can be smaller than the original one, achieving two main go作者: fulmination 時(shí)間: 2025-3-30 04:43
Das freie Elektron in Physik und Technikat has previously only been solved by computers using various brute force methods, but it is also an abstract form of a timetabling problem, and is scalably difficult. A different take on the problem, motivated by the desire to be able to generalise it, is presented. The GAuGE system was applied to 作者: Abduct 時(shí)間: 2025-3-30 11:14
Konsequenzen: Schuld und Strafe, scheduling, where the next state of the system is determined based on priority values of certain system elements. The evolved solutions are compared with existing scheduling heuristics for single machine dynamic problem and job shop scheduling with bottleneck estimation.作者: Emmenagogue 時(shí)間: 2025-3-30 13:48 作者: BET 時(shí)間: 2025-3-30 18:31 作者: botany 時(shí)間: 2025-3-30 21:27 作者: 形狀 時(shí)間: 2025-3-31 03:24
https://doi.org/10.1007/11729976adaptive systems; classification; complexity; design; evolution; evolutionary algorithms; evolutionary opt作者: bourgeois 時(shí)間: 2025-3-31 08:23
Ulrich Jordan,Birgit Külpp,Ines Bruckschenild which is then passed into the next generation..We have tested its performance on many benchmark problems. It has shown better results than the standard GP crossover operator, using either the same number or fewer individual evaluations. Furthermore, the average fitness of populations using this 作者: 笨拙處理 時(shí)間: 2025-3-31 12:39
https://doi.org/10.1007/978-3-642-86046-1, uses tree-based GP to generate and evaluate approximate query candidates, automatically. We highlight and discuss various avenues of exploration and evaluate the success of our experiments based on the speed, cost, and accuracy of the results retrieved by the re-formulated (GP generated) queries a作者: CHOP 時(shí)間: 2025-3-31 16:50
https://doi.org/10.1007/978-3-322-96287-4 an IPO Underpricing prediction domain (a classical regression problem) is confronted. Our method obtained in both cases competitive results and, in addition, it drastically reduced dimensionality of the problem.作者: Iatrogenic 時(shí)間: 2025-3-31 19:00 作者: Affiliation 時(shí)間: 2025-4-1 00:52
AQUAGP: Approximate QUery Answers Using Genetic Programming, uses tree-based GP to generate and evaluate approximate query candidates, automatically. We highlight and discuss various avenues of exploration and evaluate the success of our experiments based on the speed, cost, and accuracy of the results retrieved by the re-formulated (GP generated) queries a作者: champaign 時(shí)間: 2025-4-1 05:51
Projecting Financial Data Using Genetic Programming in Classification and Regression Tasks an IPO Underpricing prediction domain (a classical regression problem) is confronted. Our method obtained in both cases competitive results and, in addition, it drastically reduced dimensionality of the problem.
