|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
MSS, SS |
2013-03-06 14:50 |
Fukuoka |
Shikanoshima |
A Support Tool for Understanding Programs and Visualizing Algorithms
-- Creating Flowcharts Based on Hierarchical Graph Drawings -- Rei Takahara, Fumiya Makimori, Masahiro Yamauchi (Kinki Univ.), Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) MSS2012-63 SS2012-63 |
The purpose of this paper is to make a support tool for understanding programs or algorithms written by the programming ... [more] |
MSS2012-63 SS2012-63 pp.25-30 |
MSS, CAS |
2009-11-26 11:10 |
Aichi |
Nagoya University |
Extending the Legal Firing Sequence Problem of Petri Nets and Making a General-Purpose Scheduler for Web-Based Applications Masanori Nakano, Masahiro Yamauchi (Kinki Univ.), Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) |
[more] |
|
CAS, CS, SIP |
2009-03-03 15:00 |
Gifu |
Nagaragawa Convention Center |
On Solving the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs Yuichiro Taketoshi, Satoru Ochiiwa, Satoshi Taoka (Hiroshima Univ.), Masahiro Yamauchi (Kinki Univ.), Daisuke Takafuji, Toshimasa Watanabe (Hiroshima Univ.) CAS2008-140 SIP2008-203 CS2008-114 |
[more] |
CAS2008-140 SIP2008-203 CS2008-114 pp.217-222 |
CAS, MSS |
2006-11-21 10:15 |
Nagasaki |
Nagasaki Univ. |
A Visual Trace Tool of Graph Algorithms Providing Hierarchical View of Graphs Kazuya Sakamoto, Masahiro Yamauchi (Kinki Univ.), Toshimasa Watanabe (Hiroshima Univ.) |
[more] |
CAS2006-57 CST2006-33 pp.13-18 |
MSS |
2006-01-27 09:30 |
Kanagawa |
Toshiba Kagaku-Kan |
Effective Selection of Transitions in Finding Minimizing Initial Markings of Petri Nets Satoshi Taoka (Hiroshima Univ.), Masahiro Yamauchi (Kinki Univ.), Koichiro Horikoshi, Toshimasa Watanabe (Hiroshima Univ.) |
[more] |
CST2005-39 pp.1-6 |
MSS |
2005-07-01 14:05 |
Okinawa |
Jichi Kaikan(Naha) |
Fast Heuristic Algorithms based on Avoiding Occurrence of Behavioral Deadlocks for Minimizing Initial Markings of Petri Nets Satoshi Taoka (Hiroshima Univ.), Masahiro Yamauchi (Kinki Univ.), Toshimasa Watanabe (Hiroshima Univ.) |
In this paper we consider the minimum initial marking problem(MIM) of Petri nets, one of optimum initial resource alloca... [more] |
CST2005-13 pp.41-46 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|