IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 21 - 40 of 55 [Previous]  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
MSS 2009-01-29
14:15
Kanagawa Kanagawa Industrial Promotion Center An Algorithm for the Marking Construction Problem of Petri Nets Enhanced by a MAX-LFS Algorithm and Improvement of Post-processing
Toshihisa Ishii, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2008-44
The marking construction problem ({\bf MCP}) of Petri nets is defined as
follows.
``Given a Petri net $N$, an initial... [more]
CST2008-44
pp.17-22
MSS 2009-01-30
09:30
Kanagawa Kanagawa Industrial Promotion Center VNS-based Enhancing of a Distributed Branch-and-Bound Algorithm ParaBSC for the Graph Coloring Problem
Yukihiro Dougo, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2008-52
Given an undirected graph $G$, a coloring is
an assignment of colors to vertices of $G$ such that any pair of
adjacent... [more]
CST2008-52
pp.61-66
CS, SIP, CAS 2008-03-06
15:35
Yamaguchi Yamaguchi University A parallel algorithm based on area-partitioning for the rectilinear Steiner problem
Kazuhiro Egashira, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-123 SIP2007-198 CS2007-88
 [more] CAS2007-123 SIP2007-198 CS2007-88
pp.85-90
CAS 2008-01-31
13:25
Okinawa   Enhancing Algorithms for the Graph Coloring Problem
Shinji Okada, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-85
Coloring a given graph $G=(V,E)$ is to assign each vertex $v$ of $V$ a color $c(v)$ such that $c(u)$ is different from $... [more] CAS2007-85
pp.7-12
CAS 2008-02-01
16:20
Okinawa   Performance Comparison of Algorithms for the Minimum Weight Vertex Cover Problem
Takuya Kunichika, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-107
A vertex cover of a given graph $G=(V,E)$ is a subset $N$ of $V$ such that $N$ contains either $u$ or $v$ for any edge $... [more] CAS2007-107
pp.79-84
MSS 2008-01-29
14:20
Tokushima The University of Tokushima Finding Legal Firing Sequences Permitting Excess Firing of Transitions in Petri Nets
Koki Katayama, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2007-54
In this paper, we propose a heuristic algorithm LB-1 for the Lower-Bounded Firing Sequence problem of Petri nets (LBFS f... [more] CST2007-54
pp.47-52
MSS, CAS 2007-11-30
13:50
Niigata Niigata University A Heuristic Algorithm AADO for Minimizing Initial Markings of Petri Nets
Satoru Ochiiwa, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-79 CST2007-30
 [more] CAS2007-79 CST2007-30
pp.31-36
MSS 2007-08-31
15:10
Shimane Shimane University Enhancing Stability of the Fourier-Motzkin Method based on Siphon-Trap Extraction of Petri Nets
Tomohiro Chikada, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2007-16
For a Petri net = (P,T,E,α,β,), a P-invariant is a |P|-deimentional vector Y with Y^t・A = 0 for the place-transition inc... [more] CST2007-16
pp.31-36
LOIS, IPSJ-DC 2007-07-26
15:10
Hokkaido Future University-Hakodate Web-GIS based Real Estate Navigation System "Kamo-Navi" -- Improvement of Data Management Functions and Interfaces --
Tomoya Hamada, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) OIS2007-17
We have been studying on a Web-GIS based real estate navigation system. It is one of the most important criteria that lo... [more] OIS2007-17
pp.19-24
MSS 2007-06-29
10:40
Okinawa   Improving Firing Sequence Search for the Marking Construction Problem of Petri Net
Toshihisa Ishii, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2007-10
The marking construction probelm (MCP) of Petri nets is defined as
follows.
``Given a Petri net $N$, an initial marki... [more]
CST2007-10
pp.21-26
LOIS 2007-03-09
14:45
Tokyo Kikai-Shinko-Kaikan Bldg A Meta-System Maintaining Specification Consistency for Generating Web Systems
Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)
Recently, Web systems are often used for exchanging several kinds of data. High specialized knowledge and server operati... [more] OIS2006-71
pp.13-18
CAS 2007-01-29
16:10
Ehime Ehime Univ. [Invited Talk] Web Systems for Conference/Organization Management
Satoshi Taoka (Hiroshima Univ.)
 [more] CAS2006-68
pp.37-42
CAS 2007-01-30
09:30
Ehime Ehime Univ. Experiment-based Evaluation of Algorithm Performance for the 2- or 3-Vertex Connectivity Augmentation Problem
Hiroharu Sumiyoshi, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)
 [more] CAS2006-70
pp.1-6
CAS, MSS 2006-11-20
15:10
Nagasaki Nagasaki Univ. Application of a Compaction Method for Rectilinear Drawing of Graphs to Layout Design of Printed Wiring Boards
Atsushi Tsuji, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)
 [more] CAS2006-50 CST2006-26
pp.49-54
CAS, MSS 2006-11-20
15:35
Nagasaki Nagasaki Univ. Constructing a Steiner Tree of a Rectilinear Graph with Obstracles -- Enhancement based on Improved Selection of Steiner Candidate Points --
Kazuhiro Egashira, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)
 [more] CAS2006-51 CST2006-27
pp.55-60
CAS, MSS 2006-11-20
16:00
Nagasaki Nagasaki Univ. Fast and Sharp Approximation Algorithms for the Maximum Weight Matching Problem of Graphs -- Enchancing by improved search of weight augmenting paths --
Yasunori Nishikawa, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)
 [more] CAS2006-52 CST2006-28
pp.61-66
COMP 2006-09-26
14:15
Ishikawa JAIST Improved Algorithms K-LAG-V and K-LAG-VL for the Constrained Via Minimization Problem
Jun Nagai, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)
 [more] COMP2006-27
pp.15-22
MSS 2006-06-02
09:50
Ishikawa Ishikawa Science Park Experiment-based Evaluation of Algorithms for the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs
Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)
 [more] CST2006-6
pp.1-6
MSS 2006-06-02
10:15
Ishikawa Ishikawa Science Park Siphon-Trap-Based Algorithms for Computation of Petri Net Invariants with Supports Containing a Specified Place
Tomohiro Chikada, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)
 [more] CST2006-7
pp.7-12
LOIS 2006-03-10
14:15
Tokyo Kikai-Shinko-Kaikan Bldg. KAMO-NAVI:A Web-GIS-based System for Real Estate Navigation
Atsushi Kurome, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.)
 [more] OIS2005-91
pp.13-18
 Results 21 - 40 of 55 [Previous]  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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]


The Institute of Electronics, Information and Communication Engineers (IEICE), Japan