Opposition-Based Computing

DOI10.1007/978-3-540-70829-2_2zbMath1181.68156OpenAlexW2127789101MaRDI QIDQ5302471

Mario Ventresca, Hamid R. Tizhoosh, Shahryar Rahnamayan

Publication date: 7 January 2009

Published in: Oppositional Concepts in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70829-2_2

zbMATH Keywords

oppositional thinking

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (3)

Improving the Exploration Ability of Ant-Based Algorithms ⋮ A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization ⋮ New feature selection paradigm based on hyper-heuristic technique

Cites Work

• On initial populations of a genetic algorithm for continuous optimization problems
• Optimization of functions by quasi-random search methods
• Quasi-random initial population for genetic algorithms
• Application of deterministic low-discrepancy sequences in global optimization
• A novel population initialization method for accelerating evolutionary algorithms
• Similarity and dissimilarity as evidence in perceptual categorization
• The Similarity Metric
• On the convergence of sequential number-theoretic method for optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Opposition-Based Computing