Results 1  10
of
108,111
New Genetic Operators for Flowshop Problems
, 2000
"... We consider non permutation owshop problems (operation orders may dier from any machine to the next one). In previous works on layout and 2Dcutting problems, we have de ned families of crossover operators for GA approaches: direct, indirect and mixed types of encoding and operators. Considering t ..."
Abstract
 Add to MetaCart
We consider non permutation owshop problems (operation orders may dier from any machine to the next one). In previous works on layout and 2Dcutting problems, we have de ned families of crossover operators for GA approaches: direct, indirect and mixed types of encoding and operators. Considering
A New Genetic Operator Maintaining Population Diversity
"... Abstract: The paper describes an enhancement of the traditional 2point crossover operator used for binary representation in genetic algorithms. This operator preserves a schema common to both parent chromosomes. The enhancement of its functionality is in a modified treatment of this common schema. ..."
Abstract
 Add to MetaCart
Abstract: The paper describes an enhancement of the traditional 2point crossover operator used for binary representation in genetic algorithms. This operator preserves a schema common to both parent chromosomes. The enhancement of its functionality is in a modified treatment of this common schema
Genetic Programming
, 1997
"... Introduction Genetic programming is a domainindependent problemsolving approach in which computer programs are evolved to solve, or approximately solve, problems. Genetic programming is based on the Darwinian principle of reproduction and survival of the fittest and analogs of naturally occurring ..."
Abstract

Cited by 1056 (12 self)
 Add to MetaCart
genetic operations such as crossover (sexual recombination) and mutation. John Holland's pioneering Adaptation in Natural and Artificial Systems (1975) described how an analog of the evolutionary process can be applied to solving mathematical problems and engineering optimization problems using what
K.: New genetic operators to facilitate understanding of evolved transistor circuits
 In: Evolvable Hardware, 2004. Proceedings. 2004 NASA/DoD Conference on
, 2004
"... In this paper new genetic operators are introduced that inherently avoid oating terminals and broken routes while evolving transistor circuits on a CMOS eld programmable transistor array (FPTA). They are designed to facilitate understanding and improve transferability of the resulting circuits. Comp ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
In this paper new genetic operators are introduced that inherently avoid oating terminals and broken routes while evolving transistor circuits on a CMOS eld programmable transistor array (FPTA). They are designed to facilitate understanding and improve transferability of the resulting circuits
Mega: molecular evolutionary genetic analysis software for microcomputers
 CABIOS
, 1994
"... A computer program package called MEGA has been developed for estimating evolutionary distances, reconstructing phylogenetic trees and computing basic statistical quantities from molecular data. It is written in C+ + and is intended to be used on IBM and IBMcompatible personal computers. In this pr ..."
Abstract

Cited by 505 (10 self)
 Add to MetaCart
, new algorithms of branchandbound and heuristic searches are implemented. In addition, MEGA computes statistical quantities such as nucleotide and amino acid frequencies, transition/transversion biases, codon frequencies (codon usage tables), and the number of variable sites in specified segments
New evidence and perspectives on mergers
 Journal of Economic Perspectives
, 2001
"... As in previous decades, merger activity clusters by industry during the 1990s. One particular kind of industry shock, deregulation, becomes a dominant factor, accounting for nearly half of the merger activity since the late 1980s. In contrast to the 1980s, mergers in the 1990s are mostly stock swaps ..."
Abstract

Cited by 497 (3 self)
 Add to MetaCart
operating performance following mergers, relative to industry peers.
A Fast and Elitist MultiObjective Genetic Algorithm: NSGAII
, 2000
"... Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing param ..."
Abstract

Cited by 1815 (60 self)
 Add to MetaCart
is presented. Second, a selection operator is presented which creates a mating pool by combining the parent and child populations and selecting the best (with respect to fitness and spread) N solutions. Simulation results on a number of difficult test problems show that the proposed NSGAII, in most problems
Data cube: A relational aggregation operator generalizing groupby, crosstab, and subtotals
, 1996
"... Abstract. Data analysis applications typically aggregate data across many dimensions looking for anomalies or unusual patterns. The SQL aggregate functions and the GROUP BY operator produce zerodimensional or onedimensional aggregates. Applications need the Ndimensional generalization of these op ..."
Abstract

Cited by 860 (11 self)
 Add to MetaCart
by aggregating the Ncube to lower dimensional spaces. This paper (1) explains the cube and rollup operators, (2) shows how they fit in SQL, (3) explains how users can define new aggregate functions for cubes, and (4) discusses efficient techniques to compute the cube. Many of these features are being added
A NEW POLYNOMIALTIME ALGORITHM FOR LINEAR PROGRAMMING
 COMBINATORICA
, 1984
"... We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract

Cited by 860 (3 self)
 Add to MetaCart
We present a new polynomialtime algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than
Universally composable security: A new paradigm for cryptographic protocols
, 2013
"... We present a general framework for representing cryptographic protocols and analyzing their security. The framework allows specifying the security requirements of practically any cryptographic task in a unified and systematic way. Furthermore, in this framework the security of protocols is preserved ..."
Abstract

Cited by 833 (37 self)
 Add to MetaCart
is preserved under a general protocol composition operation, called universal composition. The proposed framework with its securitypreserving composition operation allows for modular design and analysis of complex cryptographic protocols from relatively simple building blocks. Moreover, within this framework
Results 1  10
of
108,111