default search action
Kazunori Mizuno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
- [j4]Asuka Hisatomi, Hitomi Koba, Kazunori Mizuno, Satoshi Ono:
ELTHON: An Escher-like Tile design method using Hierarchical Optimization. Appl. Soft Comput. 112: 107771 (2021) - [j3]Asuka Hisatomi, Tomofumi Matsuyama, Takahiro Kinoshita, Kazunori Mizuno, Satoshi Ono:
Escher-like Tiling Design from Video Images Using Convolutional Variational Autoencoder. J. Inf. Sci. Eng. 37(3): 575-592 (2021) - 2008
- [j2]Kazunori Mizuno, Seiichi Nishihara:
Constructive generation of very hard 3-colorability instances. Discret. Appl. Math. 156(2): 218-229 (2008) - 2001
- [j1]Kazunori Mizuno, Seiichi Nishihara, Hitoshi Kanoh, Isao Kishi:
Population migration: a meta-heuristics for stochastic approaches to constraint satisfaction problems. Informatica (Slovenia) 25(3) (2001)
Conference and Workshop Papers
- 2024
- [c26]Takuma Onagi, Kazunori Mizuno, Koichiro Sato:
Effectiveness of an ACO Algorithm with Levy Flight for Large-Scale Constraint Satisfaction Problems. CEC 2024: 1-7 - 2022
- [c25]Yosuke Suzuki, Kazunori Mizuno:
Two-Phase Optimization for Shift Scheduling in Individualized Teaching Cram School. TAAI 2022: 125-130 - [c24]Koichiro Sato, Kazunori Mizuno:
Emergent Generation of Camouflage Patterns by Artificial Ants. TAAI 2022: 177-182 - 2021
- [c23]Takaaki Toya, Kazunori Mizuno, Shotaro Koike:
Adaptive Ant Colony Optimization with Several Pheromone Updates for Constraint Satisfaction Problems. TAAI 2021: 19-24 - 2019
- [c22]Asuka Hisatomi, Hitomi Koba, Kazunori Mizuno, Satoshi Ono:
Application of Escher-like Tiling Design to Confectionery Shape Design. TAAI 2019: 1-6 - [c21]Takuya Masukane, Kazunori Mizuno:
Refining a Pheromone Trail Graph by Negative Feedback for Constraint Satisfaction Problems. TAAI 2019: 1-6 - 2018
- [c20]Takuya Masukane, Kazunori Mizuno, Hiroto Shinohara:
Ant Colony Optimization with Negative Feedback for Solving Constraint Satisfaction Problems. TAAI 2018: 156-159 - 2017
- [c19]Asuka Hisatomi, Hitomi Koba, Makoto Kamizono, Kazunori Mizuno, Satoshi Ono:
Escher-like tiling design using hierarchical optimization. GECCO (Companion) 2017: 89-90 - 2016
- [c18]Kazunori Mizuno, Shiho Takamatsu, Toshitsugu Shimoyama, Seiichi Nishihara:
Fireflies can find groups for data clustering. ICIT 2016: 746-751 - [c17]Takuya Masukane, Kazunori Mizuno:
Ant colony optimization with multi-pheromones for solving constraint satisfaction problems. TAAI 2016: 110-115 - 2014
- [c16]Satoshi Ono, Megumi Kisanuki, Hirofumi Machii, Kazunori Mizuno:
Creation support for Escher-like tiling patterns by interactive genetic algorithms. SIGGRAPH ASIA Posters 2014: 9 - 2013
- [c15]Yuko Aratsu, Kazunori Mizuno, Hitoshi Sasaki, Seiichi Nishihara:
Experimental Evaluation of Artificial Bee Colony with Greedy Scouts for Constraint Satisfaction Problems. TAAI 2013: 134-139 - 2012
- [c14]Daiki Hayakawa, Kazunori Mizuno, Hitoshi Sasaki, Seiichi Nishihara:
A population based cunning ant system for constraint satisfaction problems. SCIS&ISIS 2012: 2082-2087 - 2011
- [c13]Daiki Hayakawa, Kazunori Mizuno, Hitoshi Sasaki, Seiichi Nishihara:
Improving Search Efficiency Adopting Hill-Climbing to Ant Colony Optimization for Constraint Satisfaction Problems. KSE 2011: 200-204 - 2009
- [c12]Baofeng Sang, Kazunori Mizuno, Yukio Fukui, Seiichi Nishihara:
Introducing recognition ratios for urban traffic flow simulation in virtual cities. VRCAI 2009: 267-270 - 2008
- [c11]Kazunori Mizuno, Yukio Fukui, Seiichi Nishihara:
Urban Traffic Signal Control Based on Distributed Constraint Satisfaction. HICSS 2008: 65 - 2007
- [c10]Kazunori Mizuno, Seiichi Nishihara:
Distributed Constraint Satisfaction for Urban Traffic Signal Control. KSEM 2007: 73-84 - 2006
- [c9]Kazunori Mizuno, Seiichi Nishihara:
Constraint-Based Prototyping for Understanding Three Orthographic Views. ICPR (2) 2006: 1090-1093 - 2004
- [c8]Masanobu Honda, Kazunori Mizuno, Yukio Fukui, Seiichi Nishihara:
Updating Building Layouts of Time-Varying Virtual Cities. Computer Graphics International 2004: 365-368 - [c7]Masanobu Honda, Kazunori Mizuno, Yukio Fukui, Seiichi Nishihara:
Generating Autonomous Time-Varying Virtual Cities. CW 2004: 45-52 - 2003
- [c6]Satoshi Ono, Yoshinobu Hamada, Kazunori Mizuno, Yukio Fukui, Seiichi Nishihara:
A Rearrangement System for Floor Layouts based on Case-based Reasoning and Constraint Satisfaction. Applied Informatics 2003: 363-368 - [c5]Seiichi Nishihara, Kazunori Mizuno, Kohsuke Nishihara:
A Composition Algorithm for Very Hard Graph 3-Colorability Instances. CP 2003: 914-919 - 2001
- [c4]Satoshi Ono, Yoshinobu Hamada, Shinji Yamamoto, Kazunori Mizuno, Seiichi Nishihara:
Rearrangement of floor layouts based on constraint satisfaction. SMC 2001: 2759-2764 - 2000
- [c3]Kazunori Mizuno, Seiichi Nishihara:
Local minimum structures of graph-coloring problems for stochastic constraint satisfaction algorithms. ICTAI 2000: 366-369 - [c2]Satoshi Ono, Yoshinobu Hamada, Yoshitsugu Takagi, Seiichi Nishihara, Kazunori Mizuno:
Interactive Japanese-to-Braille Translation Using Case-Based Knowledge on the Web. PRICAI 2000: 638-646 - [c1]Kazunori Mizuno, Atsuki Hayashimoto, Seiichi Nishihara:
Analysis of Phase Transitions in Graph-Coloring Problems Based on Constraint Structures. PRICAI 2000: 792
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:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint