نتایج جستجو برای: crossover

تعداد نتایج: 30447  

2001
Ingo Wegener

Mutation and crossover are the main search operators of different variants of evolutionary algorithms. Despite the many discussions on the importance of crossover nobody has proved rigorously for some explicitly defined fitness functions fn : {0, 1} n → R that a genetic algorithm with crossover (but without idealization) can optimize fn in expected polynomial time while all evolution strategies...

2006
Qijin Chen C. A. Regal D. S. Jin K. Levin

We present measurements of the temperature-dependent momentum distribution of a trapped Fermi gas consisting of K in the BCS to Bose-Einstein condensation crossover regime. Accompanying theoretical results based upon a simple mean-field ground state are compared to the experimental data. Nonmonotonic effects associated with temperature T arise from the competition between thermal broadening and...

2004
ABBAS H. ZADEGAN ALI ZILOUCHIAN

ABSTRACT A new model reduction approach is proposed. The order of a large-scale system is reduced within the neighborhood of its crossover frequency in order to closely preserve the gain and phase of the original system. The minimum and maximum allowable frequency about the crossover frequency of the system is determined using frequency dependent weights. Then the system is perturbed and reduce...

Journal: :Organization Science 2007
Fiona Murray Siobhan O'Mahony

Organizational theorists have built a deep understanding of the conditions affecting knowledge sharing. However, for innovation to occur, knowledge must not just be shared, but also reused, recombined, and accumulated. Such accumulation is not inherent to the innovation process but can be either supported or limited by the context in which it occurs. We propose a framework arguing that three co...

2012

We consider a variant of the usual model for crossover designs with carryover e ects. Instead of assuming that the carryover e ect of a treatment is the same regardless of the treatment in the next period, the model assumes that the carryover e ect of a treatment on itself is di erent from the carryover e ect on other treatments. For the traditional model optimal designs tend to have pairs of c...

2017
M. Yamamoto

The superconducting proximity effect was examined in both Nb/PdNi (SF) bilayer films and Nb/PdNi/Nb (SFS) Josephson junctions. In Nb/PdNi bilayer films, nonmonotonic behavior of Tc was observed as a function of PdNi thickness dF. The effective exchange energy Eex extracted from the data was about 13 meV. In Nb/PdNi/Nb (SFS) Josephson junctions, the existence of a crossover between the 0 state a...

2004
Hermann Sellier Claire Baraduc François Lefloch Roberto Calemczuk

257005-1 We investigate the current-phase relation of S=F=S junctions near the crossover between the 0 and the ground states. We use Nb=CuNi=Nb junctions where this crossover is driven both by thickness and temperature. For a certain thickness a nonzero minimum of critical current is observed at the crossover temperature. We analyze this residual supercurrent by applying a high frequency excita...

2014
Z H Ahmed

Since crossover operator plays a vital role in genetic algorithms (GAs), several crossover operators have been proposed for the travelling salesman problem, which are then modified for the quadratic assignment problem (QAP). In this paper, we modify the sequential constructive crossover (SCX) operator for a simple GA to find heuristic solution to the QAP. Efficiency of the proposed GA using SCX...

2002
Martin Dietzfelbinger Bart Naudts Clarissa van Hoyweghen Ingo Wegener

Many experiments have proved that crossover is an essential search operator in evolutionary algorithms, at least for certain functions. However, the rigorous analysis of such algorithms on crossover-friendly functions is still in its infancy. Here a recombinative hill-climber is analyzed on the crossover-friendly function H-IFF introduced by [10]. The dynamics of this algorithm are investigated...

Journal: :CoRR 2012
Hassan Ismkhan Kamran Zamanifar

The Traveling Salesman Problem (TSP) is one of the most famous optimization problems. Greedy crossover designed by Greffenstette et al, can be used while Symmetric TSP (STSP) is resolved by Genetic Algorithm (GA). Researchers have proposed several versions of greedy crossover. Here we propose improved version of it. We compare our greedy crossover with some of recent crossovers, we use our gree...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید