![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Akichika Shiomi
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c12]Tomohiro Haraikawa, Shun Mizuno, Hidehiko Nishi, Akichika Shiomi:
QR-Label printing system for superstores enabling visually impaired customers to identify purchased products. GCCE 2013: 402-406 - 2010
- [c11]Yoshiaki Matsuzawa, Yasuhiro Noguchi, Takao Mori, Satoshi Shima, Akichika Shiomi:
ESAD: An Intensive Retreat Program for Embedded System Architect Developing. APSEC 2010: 90-97
2000 – 2009
- 2001
- [c10]Akira Kitajima, Makiko Itoh, Jun Sato, Akichika Shiomi, Yoshinori Takeuchi, Masaharu Imai:
Effectiveness of the ASIP design system PEAS-III in design of pipelined processors. ASP-DAC 2001: 649-654 - 2000
- [c9]Makiko Itoh, Shigeaki Higaki, Yoshinori Takeuchi, Akira Kitajima, Masaharu Imai, Jun Sato, Akichika Shiomi:
PEAS-III: An ASIP Design Environment. ICCD 2000: 430-436
1990 – 1999
- 1997
- [j2]Hajime Ohiwa, Naohiko Takeda, Kazuhisa Kawai, Akichika Shiomi:
KJ editor: a card-handling tool for creative work support. Knowl. Based Syst. 10(1): 43-50 (1997) - [c8]Takumi Nakano, Yoshiki Komatsudaira, Akichika Shiomi, Masaharu Imai:
VLSI implementation of a real-time operating system. ASP-DAC 1997: 679-680 - 1996
- [j1]Takumi Nakano, Andy Utama, Akichika Shiomi, Masaharu Imai, Mitsuyoshi Itabashi:
VLSI implementation and evaluation of a real-time operating system. Syst. Comput. Jpn. 27(6): 1-10 (1996) - [c7]Nguyen-Ngoc Bình, Masaharu Imai, Akichika Shiomi, Nobuyuki Hikichi:
A Hardware/Software Partitioning Algorithm for Designing Pipelined ASIPs with Least Gate Counts. DAC 1996: 527-532 - [c6]Masaharu Imai, Nguyen-Ngoc Bình, Akichika Shiomi:
A new HW/SW partitioning algorithm for synthesizing the highest performance pipelined ASIPs with multiple identical FUs. EURO-DAC 1996: 126-131 - 1995
- [c5]Nguyen-Ngoc Bình, Masaharu Imai, Akichika Shiomi, Nobuyuki Hikichi:
A hardware/software codesign method for pipelined instruction set processor using adaptive database. ASP-DAC 1995 - 1993
- [c4]Naohiko Takeda, Akichika Shiomi, Kazuhisa Kawai, Hajime Ohiwa:
Preliminary Experiment with a Distributed and Networking Card-Handling Tool Named KJ-Editor. HCI (2) 1993: 273-278 - [c3]Hajime Ohiwa, Kazuhisa Kawai, Akichika Shiomi, Naohiko Takeda:
KJ-Editor: A Collaboration Environment for Brain Storming and Consensus Forming. HCI (2) 1993: 939-942 - [c2]Naohiko Takeda, Akichika Shiomi, Kazuhisa Kawai, Hajime Ohiwa:
Requirement analysis by the KJ editor. RE 1993: 98-101 - 1992
- [c1]Naohiko Takeda, Kazuhisa Kawai, Masanobu Koyama, Akichika Shiomi, Hajime Ohiwa:
KJ-Editor: An Index-Card Style Tool. VL 1992: 255-257
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint