default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMinami Miyakawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c22]Ryo Takamiya, Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Push and Pull Search with Directed Mating for Constrained Multi-objective Optimization. CEC 2024: 1-8- 2022
- [c21]Felipe Honjo Ide, Hernán E. Aguirre, Minami Miyakawa, Darrell Whitley:
Exploring the decision and objective space of SAT constrained multi-objective problems. GECCO Companion 2022: 332-335 - 2021
- [c20]Mikiko Sato, Yuji Sato
, Mads A. Midtlyng, Minami Miyakawa:
Inconstant Update of Reference Point Value for Parallel and Distributed MOEA/D. CEC 2021: 1495-1502 - [c19]Felipe Honjo Ide, Hernán E. Aguirre, Minami Miyakawa, Darrell Whitley:
A Generator for Scalable SAT Constrained Multi-Objective Optimization Benchmark Problems. SSCI 2021: 1-8 - 2020
- [j4]Daphne Teck Ching Lai, Minami Miyakawa, Yuji Sato:
Semi-supervised data clustering using particle swarm optimisation. Soft Comput. 24(5): 3499-3510 (2020) - [c18]Yuji Sato, Mikiko Sato, Mads A. Midtlyng, Minami Miyakawa:
Parallel and Distributed MOEA/D with Exclusively Evaluated Mating and Migration. CEC 2020: 1-8
2010 – 2019
- 2019
- [c17]Yuji Sato, Mikiko Sato, Minami Miyakawa:
Distributed NSGA-II Sharing Extreme Non-dominated Solutions for Improving Accuracy and Achieving Speed-up. CEC 2019: 3086-3093 - 2018
- [c16]Yuji Sato, Mikiko Sato, Minami Miyakawa:
Distributed NSGA-II sharing extreme non-dominated solutions. GECCO (Companion) 2018: 69-70 - [c15]Minami Miyakawa, Hiroyuki Sato, Yuji Sato:
Directed mating in decomposition-based MOEA for constrained many-objective optimization. GECCO 2018: 721-728 - [c14]Minami Miyakawa, Hiroyuki Sato, Haruka Matsumoto, Mariko Tanaka, Mikiko Sato, Yuji Sato:
Effects of Duplication Operator in Evolutionary Simultaneous Design Optimization of Multiple Cars. SCIS&ISIS 2018: 478-484 - 2017
- [c13]Minami Miyakawa, Hiroyuki Sato, Yuji Sato:
Utilization of infeasible solutions in MOEA/D for solving constrained many-objective optimization problems. GECCO (Companion) 2017: 35-36 - [c12]Yuji Sato, Mikiko Sato, Minami Miyakawa:
Distributed NSGA-II with migration using compensation on many-core processors for improving performance and accuracy. GECCO (Companion) 2017: 161-162 - [c11]Hiroyuki Sato, Minami Miyakawa, Keiki Takadama:
An improved MOEA/D utilizing variation angles for multi-objective optimization. GECCO (Companion) 2017: 163-164 - [c10]Motoaki Kakuguchi, Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Multi-objetive optimization problem mapping based on algorithmic parameter rankings. SSCI 2017: 1-8 - 2016
- [j3]Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Controlling selection areas of useful infeasible solutions for directed mating in evolutionary constrained multi-objective optimization. Ann. Math. Artif. Intell. 76(1-2): 25-46 (2016) - [c9]Hiroyuki Sato, Satoshi Nakagawa, Minami Miyakawa, Keiki Takadama:
Enhanced decomposition-based many-objective optimization using supplemental weight vectors. CEC 2016: 1626-1633 - [c8]Motoaki Kakuguchi, Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Evolutionary Algorithmic Parameter Optimization of MOEAs for Multiple Multi-objective Problems. SCIS&ISIS 2016: 30-35 - 2015
- [j2]Kouhei Tomita, Minami Miyakawa, Hiroyuki Sato:
Adaptive Control of Dominance Area of Solutions in Evolutionary Many-Objective Optimization. New Math. Nat. Comput. 11(2): 135-150 (2015) - [c7]Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Directed mating using inverted PBI function for constrained multi-objective optimization. CEC 2015: 2929-2936 - [c6]Hiroyuki Sato, Minami Miyakawa, Elizabeth Pérez Cortés:
A Parallel MOEA/D Generating Solutions in Minimum Overlapped Update Ranges of Solutions. GECCO (Companion) 2015: 775-776 - [c5]Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Control of Crossed Genes Ratio for Directed Mating in Evolutionary Constrained Multi-Objective Optimization. GECCO (Companion) 2015: 1201-1204 - 2014
- [j1]Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Archive of Useful Solutions for Directed Mating in Evolutionary Constrained Multiobjective Optimization. J. Adv. Comput. Intell. Intell. Informatics 18(2): 221-231 (2014) - [c4]Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Controlling selection area of useful infeasible solutions and their archive for directed mating in evolutionary constrained multiobjective optimization. GECCO 2014: 629-636 - [c3]Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Controlling Selection Area of Useful Infeasible Solutions in Directed Mating for Evolutionary Constrained Multiobjective Optimization. LION 2014: 137-152 - 2013
- [c2]Minami Miyakawa, Keiki Takadama, Hiroyuki Sato:
Two-stage non-dominated sorting and directed mating for solving problems with multi-objectives and constraints. GECCO 2013: 647-654 - 2012
- [c1]Minami Miyakawa, Hiroyuki Sato:
An evolutionary algorithm using two-stage non-dominated sorting and directed mating for constrained multi-objective optimization. SCIS&ISIS 2012: 1441-1446
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 21:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
