Kommadath et al., 2022 - Google Patents
Parallel computing strategies for sanitized teaching learning based optimizationKommadath et al., 2022
- Document ID
- 1911852401632878075
- Author
- Kommadath R
- Maharana D
- Sivadurgaprasad C
- Kotecha P
- Publication year
- Publication venue
- Journal of Computational Science
External Links
Snippet
Abstract Teaching-Learning-Based Optimization is a metaheuristic technique that imitates the knowledge transfer in a classroom. The competitive performance with other state-of-the- art metaheuristic algorithms, innate simplicity, and the requirement of only two user-defined …
- 238000005457 optimization 0 title abstract description 105
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/12—Computer systems based on biological models using genetic models
- G06N3/126—Genetic algorithms, i.e. information processing using digital simulations of the genetic system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
- G06N3/08—Learning methods
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computer systems based on biological models
- G06N3/02—Computer systems based on biological models using neural network models
- G06N3/04—Architectures, e.g. interconnection topology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N99/00—Subject matter not provided for in other groups of this subclass
- G06N99/002—Quantum computers, i.e. information processing by using quantum superposition, coherence, decoherence, entanglement, nonlocality, teleportation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/02—Knowledge representation
- G06N5/022—Knowledge engineering, knowledge acquisition
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N5/00—Computer systems utilising knowledge based models
- G06N5/04—Inference methods or devices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Gong et al. | Evolutionary multitasking with dynamic resource allocating strategy | |
Zhou et al. | Learnable evolutionary search across heterogeneous problems via kernelized autoencoding | |
Stach et al. | A divide and conquer method for learning large fuzzy cognitive maps | |
Zhan et al. | A fast kriging-assisted evolutionary algorithm based on incremental learning | |
Deng et al. | Objective space-based population generation to accelerate evolutionary algorithms for large-scale many-objective optimization | |
Xu et al. | A review of opposition-based learning from 2005 to 2012 | |
Kommadath et al. | Parallel computing strategies for sanitized teaching learning based optimization | |
Dong et al. | A distributed adaptive optimization spiking neural P system for approximately solving combinatorial optimization problems | |
Zhang et al. | Evolutionary machine learning with minions: A case study in feature selection | |
Yu et al. | Evolutionary fuzzy neural networks for hybrid financial prediction | |
CN114492814B (en) | Method, device and medium for calculating energy of simulation target system based on quanta | |
Bhatt et al. | Genetic algorithm applications on job shop scheduling problem: A review | |
Camero et al. | Bayesian neural architecture search using a training-free performance metric | |
CN114492815B (en) | Method, device and medium for calculating target system energy based on quantum chemistry | |
Bidlo | On routine evolution of complex cellular automata | |
Zhao et al. | What makes evolutionary multi-task optimization better: A comprehensive survey | |
Moghadam et al. | An efficient genetic algorithm for flexible job-shop scheduling problem | |
Tynchenko et al. | The parallel genetic algorithm for construction of technological objects neural network models | |
Kumar | Efficient hierarchical hybrids parallel genetic algorithm for shortest path routing | |
Nugroho et al. | Parallel implementation of genetic algorithm for searching optimal parameters of artificial neural networks | |
Lin et al. | Multiobjective multitasking optimization with decomposition-based transfer selection | |
CN114512194A (en) | Method and device for acquiring target system test state in quantum chemical simulation | |
Ballinas et al. | Hybrid quantum genetic algorithm for the 0-1 knapsack problem in the IBM qiskit simulator | |
Diplock | Building new spatial interaction models by using genetic programming and a supercomputer | |
He et al. | A membrane-inspired algorithm with a memory mechanism for knapsack problems |