Akshay K. Ojha

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Y. Ramu Naidu

> Home > Persons > Akshay K. Ojha

Publications

2018
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/apin/NaiduO18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/apin/NaiduO18
Y. Ramu Naidu, Akshay K. Ojha:
A space transformational invasive weed optimization for solving fixed-point problems. Appl. Intell. 48(4): 942-952 (2018)
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/tsmc/NaiduO18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tsmc/NaiduO18
Y. Ramu Naidu, Akshay K. Ojha:
Solving Multiobjective Optimization Problems Using Hybrid Cooperative Invasive Weed Optimization With Multiple Populations. IEEE Trans. Syst. Man Cybern. Syst. 48(6): 821-832 (2018)
2015
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/soco/NaiduO15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/soco/NaiduO15
Y. Ramu Naidu, Akshay K. Ojha:
A hybrid version of invasive weed optimization with quadratic approximation. Soft Comput. 19(12): 3581-3598 (2015)
2014
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/socpros/OjhaN14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/socpros/OjhaN14
Akshay K. Ojha, Y. Ramu Naidu:
Hybridizing Particle Swarm Optimization with Invasive Weed Optimization for Solving Nonlinear Constrained Optimization Problems. SocProS (2) 2014: 595-606

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.