default search action
Shouichi Matsui
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [c14]Shouichi Matsui, Seiji Yamada:
Performance evaluation of a genetic algorithm for optimizing hierarchical menus. IEEE Congress on Evolutionary Computation 2009: 947-954 - 2008
- [c13]Shouichi Matsui, Seiji Yamada:
A genetic algorithm for optimizing hierarchical menus. IEEE Congress on Evolutionary Computation 2008: 2851-2858 - [c12]Shouichi Matsui, Seiji Yamada:
Genetic algorithm can optimize hierarchical menus. CHI 2008: 1385-1388 - [c11]Shouichi Matsui, Seiji Yamada:
Optimizing hierarchical menus by genetic algorithm and simulated annealing. GECCO 2008: 1587-1594 - 2007
- [c10]Shouichi Matsui, Seiji Yamada:
An empirical performance evaluation of a parameter-free genetic algorithm for job-shop scheduling problem. IEEE Congress on Evolutionary Computation 2007: 3796-3803 - 2005
- [j4]Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro
:
Application of the parameter-free genetic algorithm to the fixed channel assignment problem. Syst. Comput. Jpn. 36(4): 71-81 (2005) - 2004
- [j3]Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro
An efficient genetic algorithm for a fixed frequency assignment problem with limited bandwidth constraint. Syst. Comput. Jpn. 35(10): 32-39 (2004) - [c9]Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro
Empirical Performance Evaluation of a Parameter-Free GA for JSSP. GECCO (2) 2004: 1318-1319 - 2003
- [c8]Isamu Watanabe, Shouichi Matsui:
Improving the performance of ACO algorithms by adaptive control of candidate set. IEEE Congress on Evolutionary Computation 2003: 1355-1362 - [c7]Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro
Performance Evaluation of a Parameter-Free Genetic Algorithm for Job-Shop Scheduling Problems. GECCO 2003: 1598-1599 - [c6]Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro
An Efficient Hybrid Genetic Algorithm for a Fixed Channel Assignment Problem with Limited Bandwidth. GECCO 2003: 2240-2251 - 2002
- [c5]Isamu Watanabe, Kenji Okada, Ken-ichi Tokoro, Shouichi Matsui:
Adaptive multiagent model of electric power market with congestion management. IEEE Congress on Evolutionary Computation 2002: 523-528 - [c4]Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro:
An Efficient Genetic Algorithm For Fixed Channel Assignment Problem With Limited Bandwidth Constraint. GECCO 2002: 1269 - [c3]Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro
A Parameter-Free Genetic Algorithm for a Fixed Channel Assignment Problem with Limited Bandwidth. PPSN 2002: 789-799 - [c2]Shouichi Matsui, Isamu Watanabe, Ken-ichi Tokoro
Real-Coded Parameter-Free Genetic Algorithm for Job-Shop Scheduling Problems. PPSN 2002: 800-810 - 2000
- [c1]Shouichi Matsui, Ken-ichi Tokoro:
A New Genetic Algorithm for Minimum Span Frequency Assignment using Permutation and Clique. GECCO 2000: 682-689
1980 – 1989
- 1983
- [j2]Masao Iri, Kazuo Murota, Shouichi Matsui:
Heuristics for planar minimum-weight perfect metchings. Networks 13(1): 67-92 (1983) - 1981
- [j1]Masao Iri, Kazuo Murota, Shouichi Matsui:
Linear-Time Approximation Algorithms for Finding the Minimum-Weight Perfect Matching on a Plane. Inf. Process. Lett. 12(4): 206-209 (1981)
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-04-25 05:53 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: