標(biāo)題: Titlebook: Genetic and Evolutionary Computation — GECCO 2003; Genetic and Evolutio Erick Cantú-Paz,James A. Foster,Julian Miller Conference proceeding [打印本頁] 作者: Corrugate 時間: 2025-3-21 16:16
書目名稱Genetic and Evolutionary Computation — GECCO 2003影響因子(影響力)
書目名稱Genetic and Evolutionary Computation — GECCO 2003影響因子(影響力)學(xué)科排名
書目名稱Genetic and Evolutionary Computation — GECCO 2003網(wǎng)絡(luò)公開度
書目名稱Genetic and Evolutionary Computation — GECCO 2003網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Genetic and Evolutionary Computation — GECCO 2003被引頻次
書目名稱Genetic and Evolutionary Computation — GECCO 2003被引頻次學(xué)科排名
書目名稱Genetic and Evolutionary Computation — GECCO 2003年度引用
書目名稱Genetic and Evolutionary Computation — GECCO 2003年度引用學(xué)科排名
書目名稱Genetic and Evolutionary Computation — GECCO 2003讀者反饋
書目名稱Genetic and Evolutionary Computation — GECCO 2003讀者反饋學(xué)科排名
作者: Conflagration 時間: 2025-3-21 20:31
Reinforcement Learning Estimation of Distribution Algorithmpromising solutions to generate a new population of solutions. We call it Reinforcement Learning Estimation of Distribution Algorithm (RELEDA). For the estimation of the joint probability distribution we consider each variable as univariate. Then we update the probability of each variable by applyin作者: GULLY 時間: 2025-3-22 01:07
Hierarchical BOA Solves Ising Spin Glasses and MAXSAT anything easier. This paper applies hBOA to two important classes of real-world problems: Ising spin-glass systems and maximum satisfiability (MAXSAT). The paper shows how easy it is to apply hBOA to real-world optimization problems—in most cases hBOA can be applied without any prior problem analys作者: NOTCH 時間: 2025-3-22 04:57
ERA: An Algorithm for Reducing the Epistasis of SAT Problemsroduces a more suited representation (with lower epistasis) for a Genetic Algorithm (GA) by preprocessing the original SAT problem; and b) A Genetic Algorithm that solves the preprocesed instances..ERA is implemented by a simulated annealing algorithm (SA), which transforms the original SAT problem 作者: LAVE 時間: 2025-3-22 11:11
Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heurnge of problems. To be worthwhile, such a combination should outperform all of the constituent heuristics. In this paper we describe a novel messy-GA-based approach that learns such a heuristic combination for solving one-dimensional bin-packing problems. When applied to a large set of benchmark pro作者: 無法破譯 時間: 2025-3-22 15:54
Population Sizing for the Redundant Trivial Voting Mappingundant representation for binary phenotypes. A population sizing model is presented that quantitatively predicts the influence of the TV mapping and variants of this encoding on the performance of GAs. The results indicate that when using this encoding GA performance depends on the influence of the 作者: 無法破譯 時間: 2025-3-22 17:15
Non-stationary Function Optimization Using Polygenic Inheritanceing target, and tend to converge on a local optimum that appears early in a run..It is generally accepted that diploid GAs can cope with these problems because they have a ., that is, genes that may be required in the future are maintained in the current population. This paper describes a haploid GA作者: condone 時間: 2025-3-22 21:42
Scalability of Selectorecombinative Genetic Algorithms for Problems with Tight Linkage the BB mixing time and the population sizing dictated by BB mixing for single-point crossover. The population-sizing model suggests that for moderate-to-large problems, BB mixing – instead of BB decision making and BB supply – bounds the population size required to obtain a solution of constant qua作者: 顯赫的人 時間: 2025-3-23 04:24
New Entropy-Based Measures of Gene Significance and Epistasissuggest three epistasis-related measures: gene significance, gene epistasis, and problem epistasis. The measures are believed to be helpful to investigate both the individual epistasis of a gene group and the overall epistasis that a problem has. The experimental results on various well-known proble作者: 詩集 時間: 2025-3-23 08:39 作者: 平常 時間: 2025-3-23 11:43
Cellular Programming and Symmetric Key Cryptography Systemsused in the process of encryption highly depends on a quality of used random numbers. One dimensional, nonuniform CAs is considered as a generator of pseudorandom number sequences (PNSs). The quality of PNSs highly depends on a set of applied CA rules. To find such rules nonuniform CAs with two type作者: Barter 時間: 2025-3-23 15:59
Mating Restriction and Niching Pressure: Results from Agents and Implications for General EC that conduct their own, independent evaluation of (and reproduction with) other agents. In particular, we consider diversity preservation in one such agent-based EC system, applied to the multi-peak functions often used to illustrate and evaluate the effects of fitness-sharing-like schemes in GAs. 作者: 畢業(yè)典禮 時間: 2025-3-23 18:29
EC Theory: A Unified Viewpointmputation (EC), as well as distinct theoretical formulations, such as the Schema theorem and the Vose model. In particular, we show how transformations of the configuration space of the model — such as coarse-grainings/projections, embeddings and coordinate transformations — link these different, di作者: Ascendancy 時間: 2025-3-24 01:14 作者: Neuralgia 時間: 2025-3-24 03:33 作者: Arthritis 時間: 2025-3-24 08:21 作者: 誘導(dǎo) 時間: 2025-3-24 12:31 作者: Ophthalmoscope 時間: 2025-3-24 16:35
The Virtual Gene Genetic Algorithmnal one point crossover and mutation are implemented as arithmetic functions over the integers or reals that the chromosome represents. This implementation allows the generalization to virtual chromosomes of alphabets of any cardinality. Also, the sites where crossover and mutation fall can be gener作者: ERUPT 時間: 2025-3-24 20:43 作者: Entropion 時間: 2025-3-25 01:04
Alpha-Synuclein in Cerebrospinal Fluidnication latencies between workstations are eliminated by multithreaded processing, so in each workstation the high-priority model-building thread, which is communication demanding, can be overlapped by low-priority model sampling thread when necessary. High performance of MMBOA is verified via simulation in TRANSIM tool.作者: Anticonvulsants 時間: 2025-3-25 06:43
https://doi.org/10.1007/978-3-030-46547-6variables. To compare the efficiency of our proposed algorithm with other Estimation of Distribution Algorithms (EDAs) we provide the experimental results of the two problems: four peaks problem and bipolar function.作者: 冒號 時間: 2025-3-25 09:17 作者: cocoon 時間: 2025-3-25 11:40 作者: 拱形面包 時間: 2025-3-25 17:48 作者: 漂浮 時間: 2025-3-25 23:20
Marina Kojer,Ursula Gutenthaleris success of the GA is based on the crossover operator . a population whose size is moderately increasing with the dimension of the search space. Here new real royal road functions are presented where crossover leads to a small optimization time, although the GA works with the smallest possible population size — namely 2.作者: visual-cortex 時間: 2025-3-26 03:23
https://doi.org/10.1007/978-3-642-04860-9earch, and Quad Search. These algorithms are also compared with Evolutionary Strategies. Because of its rapid convergence time, we also use Quad Search to construct a hybrid genetic algorithm. The resulting algorithm is more effective than hybrid genetic algorithms using steepest ascent local search or the RBC next ascent local search algorithm.作者: Pathogen 時間: 2025-3-26 07:25 作者: 官僚統(tǒng)治 時間: 2025-3-26 09:18 作者: Compass 時間: 2025-3-26 16:04 作者: incite 時間: 2025-3-26 17:39
Cellular Programming and Symmetric Key Cryptography Systemshavior of the discovered set of CA rules very high quality PNSs are generated. The quality of PNSs outperform the quality of known one dimensional CA-based PNS generators used in secret key cryptography. The extended set of CA rules which was found makes the cryptography system much more resistant on breaking a cryptography key.作者: Comprise 時間: 2025-3-26 21:54
Mating Restriction and Niching Pressure: Results from Agents and Implications for General ECnd the introduction of . as a concept that parallels ., and which can yield insight. The utility of the niching pressure concept for general EC is explored, and directions for further research are discussed.作者: Increment 時間: 2025-3-27 02:17
Real Royal Road Functions for Constant Population Sizeis success of the GA is based on the crossover operator . a population whose size is moderately increasing with the dimension of the search space. Here new real royal road functions are presented where crossover leads to a small optimization time, although the GA works with the smallest possible population size — namely 2.作者: 撤退 時間: 2025-3-27 05:49 作者: 小丑 時間: 2025-3-27 12:27 作者: 暗指 時間: 2025-3-27 14:29 作者: obstinate 時間: 2025-3-27 19:13 作者: Deference 時間: 2025-3-27 22:43 作者: Cryptic 時間: 2025-3-28 03:56 作者: voluble 時間: 2025-3-28 08:50 作者: 積極詞匯 時間: 2025-3-28 13:40
Betreuung von dementen Menschen,alized in the vgGA to values that do not necessarily correspond to positions between bits or digits of another base, thus implementing .. Preliminary results that indicate that the vgGA outperforms a GA with binary linear chromosomes on integer and real valued problems where the underlying structure is not binary are presented.作者: 不如樂死去 時間: 2025-3-28 14:53
ERA: An Algorithm for Reducing the Epistasis of SAT Problemsby rearranging the variables to satisfy the condition that the most related ones are in closer positions inside the chromosome..Results of experimentation demonstrated that the proposed combined approach outperforms GA in all the tests accomplished.作者: 恃強凌弱 時間: 2025-3-28 21:30
Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heurblems, the learned procedure finds an optimal solution for nearly 80% of them, and for the rest produces an answer very close to optimal. When compared with its own constituent heuristics, it ranks first in 98% of the problems.作者: Negligible 時間: 2025-3-29 02:19
A Survey on Chromosomal Structures and Operators for Exploiting Topological Linkages of Genes three models: static linkage model, adaptive linkage model, and evolvable linkage model. We also provide an overview on the chromosomal structures, encodings, and operators supporting each of the models.作者: diskitis 時間: 2025-3-29 05:47
EC Theory: A Unified Viewpointsparate elements and alter the standard taxonomic classification of EC and different EC theories. As an illustration we emphasize one particular coordinate transformation between the standard string basis and the “Building Block” basis.作者: ALERT 時間: 2025-3-29 11:01 作者: JOG 時間: 2025-3-29 13:26
Dimensionality Reduction via Genetic Value Clusteringith respect to the number of items in partitioning, as compared to original idea of Park and Song. We apply developed algorithms and study their effectiveness for DNA fingerprinting in population genetics and text categorization.作者: Infusion 時間: 2025-3-29 19:38
The Virtual Gene Genetic Algorithmalized in the vgGA to values that do not necessarily correspond to positions between bits or digits of another base, thus implementing .. Preliminary results that indicate that the vgGA outperforms a GA with binary linear chromosomes on integer and real valued problems where the underlying structure is not binary are presented.作者: 心神不寧 時間: 2025-3-29 22:51 作者: TATE 時間: 2025-3-30 00:56
Dementiezorg in de praktijk, deel 1-to-large problems, BB mixing – instead of BB decision making and BB supply – bounds the population size required to obtain a solution of constant quality. Furthermore, the population sizing for single-point crossover scales as . (2...), where . is the BB size, and . is the number of BBs.作者: SUGAR 時間: 2025-3-30 07:17 作者: 迅速成長 時間: 2025-3-30 08:43 作者: Hectic 時間: 2025-3-30 15:56 作者: 凹槽 時間: 2025-3-30 19:15
Population Sizing for the Redundant Trivial Voting Mappings it decreases if the optimal solution is underrepresented. The results show that redundant representations like the TV mapping do not increase GA performance in general. Higher performance can only be achieved if there is specific knowledge about the structure of the optimal solution that can beneficially be used by the redundant representation.作者: 鳥籠 時間: 2025-3-30 20:59
Non-stationary Function Optimization Using Polygenic Inheritancef comparisons performed. We show that Polygenic inheritance enjoys all the advantages normally associated with diploid structures, with none of the usual costs, such as complex crossover mechanisms, huge mutation rates or ambiguity in the mapping process.作者: colostrum 時間: 2025-3-31 04:13
The Structure of Evolutionary Exploration: On Crossover, Buildings Blocks, and Estimation-Of-Distribtrast, the objective of EDAs is to estimate the correlations between loci and exploit this information during exploration. This may lead to an effective . of mutual information in the exploration distribution, what we define ..作者: MULTI 時間: 2025-3-31 08:25
Alpha-Synuclein in Cerebrospinal Fluidimization problem. This paper focuses on the design of parallel EDAs. More specifically, the paper describes a method for parallel construction of Bayesian networks with local structures in form of decision trees in the Mixed Bayesian Optimization Algorithm. The proposed Multithreaded Mixed Bayesian作者: Insubordinate 時間: 2025-3-31 09:55
https://doi.org/10.1007/978-3-030-46547-6promising solutions to generate a new population of solutions. We call it Reinforcement Learning Estimation of Distribution Algorithm (RELEDA). For the estimation of the joint probability distribution we consider each variable as univariate. Then we update the probability of each variable by applyin作者: 駁船 時間: 2025-3-31 16:32
C. Ballard,C. Morris,M. Piggott anything easier. This paper applies hBOA to two important classes of real-world problems: Ising spin-glass systems and maximum satisfiability (MAXSAT). The paper shows how easy it is to apply hBOA to real-world optimization problems—in most cases hBOA can be applied without any prior problem analys作者: 灌輸 時間: 2025-3-31 20:02 作者: Valves 時間: 2025-3-31 22:27
De kwetsbare ouderdom & systeemvisie,nge of problems. To be worthwhile, such a combination should outperform all of the constituent heuristics. In this paper we describe a novel messy-GA-based approach that learns such a heuristic combination for solving one-dimensional bin-packing problems. When applied to a large set of benchmark pro作者: 心胸開闊 時間: 2025-4-1 03:58 作者: 仲裁者 時間: 2025-4-1 06:15
https://doi.org/10.1007/978-90-368-0772-2ing target, and tend to converge on a local optimum that appears early in a run..It is generally accepted that diploid GAs can cope with these problems because they have a ., that is, genes that may be required in the future are maintained in the current population. This paper describes a haploid GA
