default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYoshitomo Ikkai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1997
[j2]Yoshitomo Ikkai, Kaname Kakihara, Takenao Ohkawa, Norihisa Komoda, Katsuhiko Doi, Isao Tone:
Automatic regeneration of sequence programs for operating plants. IEEE Robotics Autom. Mag. 4(2): 20-26 (1997)- 1996
- [j1]Yoshitomo Ikkai, Takenao Ohkawa, Norihisa Komoda:
Recursive learning method for knowledge-based planning system. J. Intell. Manuf. 7(5): 405-410 (1996)
Conference and Workshop Papers
- 2006
- [c21]Hiroaki Chujo, Hironori Oka, Yoshitomo Ikkai, Norihisa Komoda:
A Consideration of Application of Attractor Selection to a Real-Time Production Scheduling. BioADIT 2006: 346-354 - 2005
- [c20]Masaki Samejima, Shingo Tamura, Yoshitomo Ikkai, Norihisa Komoda:
A scheduling method in multi-item production adjusting to urgent orders based on job modifiability. ETFA 2005 - 2004
- [c19]Taiki Shojima, Yoshitomo Ikkai, Norihisa Komoda:
A method for mediator identification using queued history of encrypted user information in an incentive attached peer to peer electronic coupon system. SMC (1) 2004: 1086-1091 - [c18]Nobuyuki Kawamura, Yohei Kawakita, Yoshitomo Ikkai, Norihisa Komoda:
A high-speed scheduling method by parallel and asymptotic taboo searches for large-scale job shops problems with group constraints. SMC (2) 2004: 1452-1457 - [c17]Hiroaki Chujo, Yuji Shono, Yoshitomo Ikkai, Norihisa Komoda:
A rapid scheduling method with resource selection by flaw analysis for a rectangular cutting stock problem against flawed and connectable resources. SMC (2) 2004: 1458-1463 - [c16]Kentaro Tsuchida, Hiroaki Oka, Yoshitomo Ikkai, Norihisa Komoda:
A robust scheduling method for a job shop problem in production by using data carriers. SMC (2) 2004: 1464-1468 - 2003
- [c15]Rei Itsuki, Hiroshi Shibata, Yoshitomo Ikkai, Norihisa Komoda:
The autonomous information system design for item management using rewritable RF-ID tags in supply chain. ETFA (2) 2003: 27-34 - [c14]Hisatoshi Ohmae, Yoshitomo Ikkai, Norihisa Komoda, Kuniyoshi Horiuchi, Hidenobu Hamamoto:
A high speed scheduling method by analyzing job flexibility and taboo search for a large-scale job shop problem with group constraints. ETFA (2) 2003: 227-232 - [c13]Yuji Shono, Yoshitomo Ikkai, Norihisa Komoda, Satoshi Imai, Hidenobu Hamamoto:
A rapid scheduling method by using gradual assignment for a rectangular cutting stock problem for flawed and connectable resources. ETFA (2) 2003: 233-238 - [c12]Hironori Oka, Yoshitomo Ikkai, Norihisa Komoda:
A procurement negotiation method using objective relaxation knowledge for appeasement. ETFA (2) 2003: 245-250 - 2002
- [c11]Yoshitomo Ikkai, Takaaki Nakashiba, Norihisa Komoda:
Application of specification language SOL and its verification method to a flexible manufacturing line. ACC 2002: 4159-4164 - 2001
- [c10]Takaaki Nakasiba, Akitsugu Tsuchiya, Yoshitomo Ikkai, Norihisa Komoda, Yasuo Namioka:
Intelligible description language and its rapid verification method for design support of distributed sequential control systems. ETFA (2) 2001: 51-56 - [c9]Kuniyoshi Horiuchi, Taiji Takii, Hideo Ikeda, Yoshitomo Ikkai:
Application of compatibility with delivery and manufacture in material industry. ETFA (2) 2001: 329-334 - [c8]Kyouhei Ishihara, Shingo Honda, Yoshitomo Ikkai, Norihisa Komoda, Hirokazu Takahashi, Hideo Ikeda:
A rapid planning method of practicable solution with conversational function of constraints relaxation for a process ordering problem using spare jobs. ETFA (2) 2001: 337-342 - [c7]Hironori Oka, Tsutomu Hasegawa, Yoshitomo Ikkai, Norihisa Komoda:
A bilateral negotiation method using satisfying level with knowledge of purpose analysis. ETFA (2) 2001: 359-364 - [c6]Tsutomu Hasegawa, Hironori Oka, Yoshitomo Ikkai, Norihisa Komoda:
A negotiation method using improvement knowledge for bilateral exchange and distribution negotiation. SMC 2001: 2805-2810 - 2000
- [c5]Tomoyuki Kitagawa, Tetsuya Maruta, Yoshitomo Ikkai, Norihisa Komoda:
A description language based on multi-functional modeling and a supply chain simulation tool. SMC 2000: 2287-2292 - 1999
- [c4]Sen'ichi Onoda, Yoshitomo Ikkai, Takashi Kobayashi, Norihisa Komoda:
Definition of Deadlock Patterns for Business Processes Workflow Models. HICSS 1999 - [c3]Yoshitomo Ikkai, Kazuhisa Ikeda, Norihisa Komoda, Akira Yamane, Isao Tone:
Sequential Control Logic Inferring Method from Observed Plant I/O Data. IDA 1999: 449-460 - 1998
- [c2]Tetsuya Maruta, Sen'ichi Onoda, Yoshitomo Ikkai, Takashi Kobayashi, Norihisa Komoda:
A deadlock detection algorithm for business processes workflow models. SMC 1998: 611-616 - [c1]Shingo Honda, Ayako Hiramatsu, Hiroko Yamamatsu, Hiroshi Morihisa, Yoshitomo Ikkai:
A training program for building client server systems and its evaluation using WWW browser. SMC 1998: 2866-2871
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-24 23:03 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:
