標(biāo)題: Titlebook: Artificial Evolution; Third European Confe Jin-Kao Hao,Evelyne Lutton,Dominique Snyers Conference proceedings 1998 Springer-Verlag Berlin H [打印本頁] 作者: stripper 時間: 2025-3-21 17:12
書目名稱Artificial Evolution影響因子(影響力)
書目名稱Artificial Evolution影響因子(影響力)學(xué)科排名
書目名稱Artificial Evolution網(wǎng)絡(luò)公開度
書目名稱Artificial Evolution網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Artificial Evolution被引頻次
書目名稱Artificial Evolution被引頻次學(xué)科排名
書目名稱Artificial Evolution年度引用
書目名稱Artificial Evolution年度引用學(xué)科排名
書目名稱Artificial Evolution讀者反饋
書目名稱Artificial Evolution讀者反饋學(xué)科排名
作者: 悲觀 時間: 2025-3-21 23:55 作者: Nucleate 時間: 2025-3-22 02:06 作者: 發(fā)誓放棄 時間: 2025-3-22 05:44
978-3-540-64169-8Springer-Verlag Berlin Heidelberg 1998作者: 發(fā)展 時間: 2025-3-22 09:12
Aaron Nicolson,Jason Dowling,Bevan Koopmanolving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, these methods use strategies for combining solution vectors that have proved effective for scheduling, routing, financial product des作者: 撕裂皮肉 時間: 2025-3-22 14:10 作者: escalate 時間: 2025-3-22 19:25
Single Crystal Fabrication/Orientationthe . sleep during which the system is widely disconnected from its environment. The dream phase allows the population to reorganize and maintain a needed diversity. Experiments show that dreamy genetic algorithms improve on standard genetic algorithm, for both stationary (deceptive) and non-station作者: maculated 時間: 2025-3-22 23:59 作者: 爭論 時間: 2025-3-23 04:04 作者: 滔滔不絕的人 時間: 2025-3-23 06:57
Experiment and the Molecularity of Meaning,ng his interactions with a digital assistant. This study is done in the framework of “broadcasting” on the Internet. In our experiment, a multi-agent system with a Genetic Algorithm is used to globally optimize a user‘s selection of “channels” among a very large number of choices. We show that this 作者: micronized 時間: 2025-3-23 10:04 作者: FEIGN 時間: 2025-3-23 17:20
Results - fluidised bed calcium looping,ic values to nominal values. However, stream traffic values are not measured by the on-line data acquisition system and, hence, have to be computed. We perform this computation by inverting an approximate knowledge based model of stream propagation in circuit-switched networks. This inversion is com作者: sleep-spindles 時間: 2025-3-23 20:25 作者: 不如樂死去 時間: 2025-3-24 02:07 作者: Fortuitous 時間: 2025-3-24 04:34
in particular. Here, each automaton is represented directly by its state transition table and the number of states is allowed to change dynamically as evolution takes place. This approach contrasts with less natural representation methods such as trees of genetic programming, and allows for easier 作者: ensemble 時間: 2025-3-24 06:46 作者: 龍蝦 時間: 2025-3-24 13:20
um. It is known that, after a long time, the equilibrium is punctuated suddenly and the population transits into the better neighbor optimum. We adopt the formalization of Computational Ecosystems to show that the dynamics of the Simple Genetic Algorithm is represented by a differential equation foc作者: 反復(fù)無常 時間: 2025-3-24 17:19
Joining Techniques - State of the Art,der functions, whose optimization is shown to be an NP-equivalent problem. It appears that both algorithms approach these fitness functions in the same, intuitive way: they start by deciding the obvious and most probable, and then they proceed to make more difficult decisions. Useful information abo作者: 有組織 時間: 2025-3-24 20:08
Experiments in Theatre: Maurice Meldon,re is a broad class of alternative mutation distributions offering local convergence rates being asymptotical equal to the convergence rates achieved with normally distributed mutations. Such mutation distributions must be factorizing and the absolute fourth moments must be finite. Under these condi作者: 血友病 時間: 2025-3-25 00:47 作者: 裂縫 時間: 2025-3-25 05:21 作者: 表主動 時間: 2025-3-25 09:32
Large-Scale Manipulative Experiments (GA). We give first a review of the work on these measures such as the epistasis correlation. Then we try to relate the epistasis correlation to the overall performances of a binary GA on a set of 14 functions. The only relation that seems to hold strongly is that a high epistasis correlation impli作者: quiet-sleep 時間: 2025-3-25 13:57 作者: 白楊魚 時間: 2025-3-25 18:59 作者: 使饑餓 時間: 2025-3-25 20:21 作者: 發(fā)現(xiàn) 時間: 2025-3-26 03:15 作者: 委托 時間: 2025-3-26 06:09
Large-Scale Manipulative Experiments done in two steps. First, the fitness landscape to be optimized is analyzed. Secondly, the performance of different search procedures is described. The insight gained from the fitness landscape analysis is related to the performance of the different search procedures.作者: AVANT 時間: 2025-3-26 09:00 作者: Digest 時間: 2025-3-26 12:45 作者: debunk 時間: 2025-3-26 19:39
Adaptive penalties for evolutionary graph coloring,pendent way to handle constrained problems. Second, it leads to superior EA performance. In an extensive series of comparative experiments we show that the SAW-ing EA outperforms a powerful graph coloring heuristic algorithm, DSatur, on the hardest graph instances and has a linear scale-up behaviour.作者: 嘴唇可修剪 時間: 2025-3-26 23:19
An analysis of punctuated equilibria in simple genetic algorithms,using on the population mean of a phenotype. Referring to the studies of differential equations of this form, we show that the duration time of metastability is exponential in the population size and other parameters, on the one dimensional bistable fitness landscape which has one metastable and one stable state.作者: Interlocking 時間: 2025-3-27 01:14 作者: 即席 時間: 2025-3-27 05:40 作者: CODE 時間: 2025-3-27 09:44
Single Crystal Fabrication/Orientationhich transform the traditional fitness landscape of SAT into more distinguishable ones. Furthermore, new genetic operators (mutation and crossover) are introduced. These genetic operators incorporate problem specific knowledge and thus, lead to increased performance in comparison to standard operators.作者: 閑蕩 時間: 2025-3-27 14:22 作者: OVER 時間: 2025-3-27 19:58
problem. GA optimisation techniques can provide useful results, even in the very particular area of mathematical analysis. This paper presents the results we have obtained on the inverse problem for fixed point automata. Software implementation has been developed with the help of “ALGON”, our home-made Genetic Algorithm software.作者: Immobilize 時間: 2025-3-28 01:43
Joining Techniques - State of the Art,e, intuitive way: they start by deciding the obvious and most probable, and then they proceed to make more difficult decisions. Useful information about the optimization problem is, among others, provided by statistical physics: lattice gases can be modeled as second order functions.作者: 公司 時間: 2025-3-28 03:16
Experiments in Theatre: Maurice Meldon,with normally distributed mutations. Such mutation distributions must be factorizing and the absolute fourth moments must be finite. Under these conditions an asymptotical theory of the convergence rates of simple evolutionary algorithms can be established for the entire class of distributions.作者: braggadocio 時間: 2025-3-28 07:41
Representations, fitness functions and genetic operators for the satisfiability problem,hich transform the traditional fitness landscape of SAT into more distinguishable ones. Furthermore, new genetic operators (mutation and crossover) are introduced. These genetic operators incorporate problem specific knowledge and thus, lead to increased performance in comparison to standard operators.作者: 全面 時間: 2025-3-28 12:15
An agent system for learning profiles in broadcasting applications on the Internet,system with a Genetic Algorithm is used to globally optimize a user‘s selection of “channels” among a very large number of choices. We show that this approach could solve the problem of providing multiple optimal solutions without losing diversity.作者: 讓你明白 時間: 2025-3-28 16:09 作者: maverick 時間: 2025-3-28 20:09 作者: Homocystinuria 時間: 2025-3-29 01:19
Asymptotical convergence rates of simple evolutionary algorithms under factorizing mutation distribwith normally distributed mutations. Such mutation distributions must be factorizing and the absolute fourth moments must be finite. Under these conditions an asymptotical theory of the convergence rates of simple evolutionary algorithms can be established for the entire class of distributions.作者: 安定 時間: 2025-3-29 04:47 作者: Exhilarate 時間: 2025-3-29 10:48 作者: 卡死偷電 時間: 2025-3-29 11:56 作者: Notify 時間: 2025-3-29 16:15
cient to achieve the transition by a chain of small mutations. Consequently, even one-bit mutations would be sufficient to make the GA globally convergent, because they can be chained to achieve a multi-bit mutation. All this study is performed with respect to the theory of non-negative matrices and their relationship to Markov chains.作者: vasculitis 時間: 2025-3-29 21:23 作者: 得意牛 時間: 2025-3-30 01:23 作者: intimate 時間: 2025-3-30 07:28 作者: 占線 時間: 2025-3-30 09:27
A critical and empirical study of epistasis measures for predicting GA performances: A summary,at improve epistasis measures does not imply the same increasing in the genetic algorithm performances. These both empirical studies seem to indicate that the generality of epistasis measures is limited.作者: Charitable 時間: 2025-3-30 12:55
Conference proceedings 1998-of-the-art in scatter search by Fred Glover. The papers are organized in topical sections on genetic-algorithm operators, applications in various areas, theoretical issues, methodologies, and evolvable hardware and robotics.作者: INERT 時間: 2025-3-30 17:30 作者: Emg827 時間: 2025-3-30 22:28 作者: GORGE 時間: 2025-3-31 02:05 作者: infantile 時間: 2025-3-31 05:30 作者: 整潔漂亮 時間: 2025-3-31 12:36
Large-Scale Manipulative Experimentsimum of a static fitness function. The results presented in this paper suggest that providing enough variation among the population members and applying a selection scheme is sufficient for adaptation. The resulting performance, however, depends on the problem, the selection scheme, the variation operators, as well as possibly other factors.作者: 路標(biāo) 時間: 2025-3-31 15:33 作者: helper-T-cells 時間: 2025-3-31 20:39
Aaron Nicolson,Jason Dowling,Bevan Koopmanscatter search and path relinking that are fully specified upon providing a handful of subroutines. Illustrative forms of these subroutines are described that make it possible to create methods for a wide range of optimization problems.作者: inclusive 時間: 2025-4-1 01:32 作者: FORGO 時間: 2025-4-1 03:50
s indicate the feasibility of the evolutionary approach. Since Turing machines can be viewed as general representations of computer programs, the proposed approach can be thought of as a step towards the generation of programs and algorithms by evolution.作者: Project 時間: 2025-4-1 09:28 作者: 發(fā)牢騷 時間: 2025-4-1 11:40 作者: critic 時間: 2025-4-1 15:46 作者: neutralize 時間: 2025-4-1 21:06
