The following pages link to Xin Yao (Q197488):
Displaying 50 items.
- (Q222047) (redirect page) (← links)
- (Q319856) (redirect page) (← links)
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- (Q416272) (redirect page) (← links)
- Crossover can be constructive when computing unique input-output sequences (Q416273) (← links)
- On the approximation ability of evolutionary optimization with application to minimum set cover (Q420829) (← links)
- A large population size can be unhelpful in evolutionary algorithms (Q428903) (← links)
- (Q521680) (redirect page) (← links)
- The time complexity analysis of a class of gene expression programming (Q521683) (← links)
- (Q588389) (redirect page) (← links)
- The impact of payoff function and local interaction on the \(N\)-player iterated prisoner's dilemma (Q698735) (← links)
- Towards an analytic framework for analysing the computation time of evolutionary algorithms (Q814443) (← links)
- Experimental study on population-based incremental learning algorithms for dynamic optimization problems (Q816849) (← links)
- Choosing selection pressure for wide-gap problems (Q847671) (← links)
- Ensemble learning using multi-objective evolutionary algorithms (Q864942) (← links)
- Runtime analysis of the \((1+1)\) EA on computing unique input output sequences (Q903582) (← links)
- Large scale evolutionary optimization using cooperative coevolution (Q933651) (← links)
- Unified eigen analysis on multivariate Gaussian based estimation of distribution algorithms (Q933653) (← links)
- Negative correlation in incremental learning (Q1024030) (← links)
- Finding approximate solutions to NP-hard problems by neural networks is hard (Q1186583) (← links)
- Towards designing artificial neural networks by evolution (Q1294128) (← links)
- A note on neural sorting networks with O(1) time complexity (Q1352092) (← links)
- Erratum to: ``Drift analysis and average time complexity of evolutionary algorithms'' (Q1614869) (← links)
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
- A study of drift analysis for estimating computation time of evolutionary algorithms (Q1768779) (← links)
- A general finite element method: extension of variational analysis for nonlinear heat conduction with temperature-dependent properties and boundary conditions, and its implementation as local refinement (Q2234849) (← links)
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms (Q2321329) (← links)
- Dynamical characteristics of pre-epileptic seizures in rats with recurrence quantification ana\-lysis (Q2463129) (← links)
- Uncovering delayed patterns in noisy and irregularly sampled time series: an astronomy application (Q2654307) (← links)
- A gradually implicit method with deferred correction and adaptive relaxation factors for simulation to nonlinear heat transfer (Q2657280) (← links)
- Analysis of noisy evolutionary optimization when sampling fails (Q2661993) (← links)
- Kernel truncated regression representation for robust subspace clustering (Q2663551) (← links)
- Evolution Strategies on Desktop Grid Environment Using Scheduling Algorithms RR for Same Length Tasks (Q2820623) (← links)
- Simulated annealing and joint manufacturing batch-sizing (Q3155574) (← links)
- (Q3224102) (← links)
- An extended contract net mechanism for dynamic supply chain formation and its application in China petroleum supply chain management (Q3429092) (← links)
- A HYBRID ESTIMATION OF DISTRIBUTION ALGORITHM FOR CDMA CELLULAR SYSTEM DESIGN (Q3631240) (← links)
- Simulated annealing with extended neighbourhood (Q3991121) (← links)
- Parallel genetic algorithm on PVM (Q4229588) (← links)
- (Q4327438) (← links)
- (Q4370810) (← links)
- (Q4418701) (← links)
- (Q4448773) (← links)
- A generic design model for evolutionary algorithms (Q4454470) (← links)
- Evolutionary Design of Digital Filters With Application to Subband Coding and Data Transmission (Q4564431) (← links)
- (Q4707955) (← links)
- A new simulated annealing algorithm (Q4876349) (← links)
- (Q4980857) (← links)
- Adversarial Feature Alignment: Avoid Catastrophic Forgetting in Incremental Task Lifelong Learning (Q5214401) (← links)
- On the impact of the mutation-selection balance on the runtime of evolutionary algorithms (Q5276062) (← links)
