Taoka Satoshi 田岡智志

… Alternative Names

TAOKA Satoshi 田岡智志

田岡智志タオカサトシ

Less

Researcher Number	80274116
Other IDs
External Links
Affiliation (Current)	2025: 広島大学, 先進理工系科学研究科(工), 助教
Affiliation (based on the past Project Information) *help	2012: 広島大学, 工学(系)研究科(研究院), 助教 2010 – 2012: 広島大学, 大学院・工学研究院, 助教 2007 – 2009: Hiroshima University, Graduate School of Engineering, Assistant Professor 2006: 広島大学, 大学院・工学研究科, 助手 2006: 広島大学, 大学院工学研究科, 助手 2003 – 2004: 広島大学, 大学院・工学研究科, 助手 1996: 広島大学, 工学部, 助手
Review Section/Research Field	Principal Investigator Software / 計算機科学 Except Principal Investigator Fundamental theory of informatics
Keywords	Principal Investigator 計算機実験と評価 / ネット理論 / グラフ理論 / 近似解法 / アルゴリズム設計 / ベクター加算システム / 近似解精度 / ネットワーク信頼性 / グラフの点連結度 / グラフの辺連結度 … More / ネットワーク最適化問題 / ネットワークの信頼性 / 確率ネットワーク / 情報ネットワーク構成法 / 発見的解法 / 総当り的解法 / 多項式時間解法 / NP困難問題 / 解法の効率化 … More Except Principal Investigator アルゴリズムの効率化 / グラフの辺連結度 / グラフの点連結度 / グラフ理論 / 近似解精度 / 近似アルゴリズム / アルゴリズム設計 / 最大フロー / ベクター加算システム / アルゴリズムの効率 / Vector-Addition Systems / Graph Theory / Performance Ratio / Approximation Algorithms / Efficiency of Algorithms / Designing Algorithms / Maximum Flows / Connectivity of Graphs / アルゴリズム効率化 / グラフの連結度 / Maximum flow / Graph theory / Performance ratios / Approximation algorithms / Efficiency of algorithms / Design of algorithms / Edge connectivity of graphs / Vertex connectivity of graphs / アルゴリスム設計 Less

Development ofPractical Algorithms for Network Optimization Problems in order to Improve Reliability of Information NetworksPrincipal Investigator
- Principal Investigator
  
  TAOKA Satoshi
- Project Period (FY)
  2010 – 2012
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Software
- Research Institution
  Hiroshima University
Integrated Research on Connectivity of Graphs and its Applications
- Principal Investigator
  
  WATANABE Toshimasa
- Project Period (FY)
  2008 – 2010
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Hiroshima University
Development of Practical Algorithms for Network Optimization Problems based on Computer ExperimentsPrincipal Investigator
- Principal Investigator
  
  TAOKA Satoshi
- Project Period (FY)
  2006 – 2008
- Research Category
  
  Grant-in-Aid for Young Scientists (B)
- Research Field
  
  Software
- Research Institution
  Hiroshima University
Integrated Research on Connectivity of Graphs
- Principal Investigator
  
  WATANABE Toshimasa
- Project Period (FY)
  2006 – 2007
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  Hiroshima University
A study on Connectivity of Graphs and Its Applications
- Principal Investigator
  
  WATANABE Toshimasa
- Project Period (FY)
  2003 – 2004
- Research Category
  
  Grant-in-Aid for Scientific Research (C)
- Research Field
  
  Fundamental theory of informatics
- Research Institution
  HIROSHIMA UNIVERSITY
ネットワーク構成法における問題の解法の高速化および性能評価に関する研究Principal Investigator
- Principal Investigator
  
  田岡智志
- Project Period (FY)
  1996
- Research Category
  
  Grant-in-Aid for Encouragement of Young Scientists (A)
- Research Field
  
  計算機科学
- Research Institution
  Hiroshima University

All 2013 2012 2011 2010 2009 2008 2007 2006 2005 2003

All Journal Article Presentation

[Journal Article] A Distributed Algorithm for 2-Edge-Connectivity Augmentation Problem of a Connected Graph"2013
- Author(s)
  Satoshi Taoka, and Toshimasa Watanabe
- Journal Title
  
  The 28th International Technical Conference on Circuits/Systems, Computers and Communications
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500029
[Journal Article] Computing-based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs2013
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: Vol.E96-A, No.6
- NAID
  10031193819
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500029
[Journal Article] A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints2012
- Author(s)
  Tadachika OKI, Satoshi TAOKA, Toshiya MASHIMA, Toshimasa WATANABE
- Journal Title
  
  IEICE Trans. Information and Systems
  
  Volume: 3 Pages: 769-777
- NAID
  10030611587
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500029
[Journal Article] The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms2011
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans.Fundamentals
  
  Volume: Vol.E94-A, No.9 Pages: 1833-1841
- NAID
  10030190835
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500029
[Journal Article] The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms2011
- Author(s)
  Satoshi Taoka, Toshimasa Watanabe
- Journal Title
  
  IEICE Trans. Fundamentals
  
  Volume: 9 Pages: 1833-1841
- NAID
  10030190835
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-22500029
[Journal Article] Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets2009
- Author(s)
  Toshimasa WATANBE, Satoshi TAOKA.
- Journal Title
  
  IEICE Trans.Fundamentals Vol.E92-A, No.4
  
  Pages: 2707-2716
- NAID
  10026860688
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500015
[Journal Article] Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets2009
- Author(s)
  Satoru OCHIIWA, Satoshi TAOKA, Masahiro YAMAUCHI, Toshimasa WATANABE.
- Journal Title
  
  IEICE Trans.Fundamentals Vol.E92-A, No.4
  
  Pages: 2732-2744
- NAID
  10026860736
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500015
[Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Goloring problem2008
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans Fundamientals 91-A(印刷中)
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2008
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans. Fundamentals 91-A
  
  Pages: 1140-1149
- NAID
  10026848774
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500015
[Journal Article] Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs2008
- Author(s)
  Daisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, Toshimasa Watanabe.
- Journal Title
  
  IEICE Trans.Fundamentals Vol.91-A, No.4
  
  Pages: 1129-1139
- NAID
  10026848759
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500015
[Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2008
- Author(s)
  Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe.
- Journal Title
  
  IEICE Trans.Fundamentals Vol.91-A, No.4
  
  Pages: 1140-1149
- NAID
  10026848774
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-20500015
[Journal Article] Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs2008
- Author(s)
  Dasisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, and Toshimasa Watanabe
- Journal Title
  
  IEICE Trans. Fundamentals Vol. 91-A, No. 4
  
  Pages: 1129-1139
- NAID
  10026848759
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2008
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans. Fundamentals 91-A
  
  Pages: 1140-1149
- NAID
  10026848774
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2008
- Author(s)
  Satoshi Taoka, Dasisuke Takafuji, and Toshimasa Watanabe
- Journal Title
  
  IEICE Trans. Fundamentals Vol. 91-A, No. 4
  
  Pages: 1140-1149
- NAID
  10026848774
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2008
- Author(s)
  Satoshi, Taoka
- Journal Title
  
  IEICE Trans. Fundamentals 91-A, 4
  
  Pages: 1140-1149
- NAID
  10026848774
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-18500014
[Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2008
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans. Fundamentals E91-A4号
  
  Pages: 1140-1149
- NAID
  10026848774
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18500014
[Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2008
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans. Fundamentals 91-A(印刷中)
- NAID
  10026848774
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18500014
[Journal Article] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem2007
- Author(s)
  Satoshi, Taoka
- Journal Title
  
  IEICE Trans. Fundamentals 90-A, 4
  
  Pages: 847-856
- NAID
  110007519143
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-18500014
[Journal Article] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem2007
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans. Fundamentals E90-A・4
  
  Pages: 847-856
- NAID
  110007519143
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem2007
- Author(s)
  Satoshi Taoka, Dasisuke Takafuji, Takashi Iguchi, and Toshimasa Watanabe
- Journal Title
  
  IEICE Trans. Fundamentals Vol. E90-A, No. 4
- NAID
  110007519143
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem2007
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans. Fundamentals E90-A4号
  
  Pages: 847-856
- NAID
  110007519143
- Description
  「研究成果報告書概要(和文)」より
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18500014
[Journal Article] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem2007
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans. Fundamentals E90-A・4
  
  Pages: 847-856
- NAID
  110007519143
- Data Source
  KAKENHI-PROJECT-18500014
[Journal Article] Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs2006
- Author(s)
  Satoshi Taoka, and Toshimasa Watanabe
- Journal Title
  
  IEICE Trans. Fundamentals Vol. E89-A, No. 11
  
  Pages: 3216-3226
- NAID
  110007537814
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Experiment-based Evaluation of Algorithms for the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs2006
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Technical Report CST2006-6
  
  Pages: 1-6
- NAID
  110004776249
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets With Inhibitor Arcs2006
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Trans. Fundamentals E89-A・11
  
  Pages: 3216-3226
- NAID
  110007537814
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree2006
- Author(s)
  Toshiya Mashima, Satoshi Taoka, and Toshimasa Watanabe
- Journal Title
  
  IEICE Trans. Fundamentals Vol. E89-A, No. 4
  
  Pages: 1042-1048
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs2006
- Author(s)
  Satoshi Taoka, Kazuya Watanabe, and Toshimasa Watanabe
- Journal Title
  
  IEICE Trans. Fundamentals Vol. E89-A, No. 4
  
  Pages: 1049-1057
- NAID
  110007502808
- Peer Reviewed
- Data Source
  KAKENHI-PROJECT-18700031
[Journal Article] Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph2005
- Author(s)
  Satoshi Taoka
- Journal Title
  
  Proc.2005 IEEE International Symposium on Circuit and Systems (掲載予定)
- NAID
  110003178767
- Data Source
  KAKENHI-PROJECT-15500011
[Journal Article] Maximum Weight Matching-Based Algorithms for κ-Edge-Connectivity Augmentation of a Graph2005
- Author(s)
  Satoshi Taoka
- Journal Title
  
  Proc.2005 IEEE International Symposium on Circuit and Systems
  
  Pages: 2231-2234
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-15500011
[Journal Article] Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph2005
- Author(s)
  Satoshi Taoka
- Journal Title
  
  Proc. 2005 IEEE International Symposium on Circuit and Systems
  
  Pages: 2231-2234
- NAID
  110003178767
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-15500011
[Journal Article] A 2-Approximation Algorithm FSA+1 to (λ+1)-Edge-Connect a Specified Set of Vertices in a λ-Edge-Connected Graph2003
- Author(s)
  Satoshi Taoka
- Journal Title
  
  Proc. 2003 IEEE International Symposium on Circuit and Systems
- NAID
  110002811930
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-15500011
[Journal Article] PCクラスタ並列分枝限定解法における節点・変数選択規則の実験的評価2003
- Author(s)
  田岡智志
- Journal Title
  
  IEICE Technical Report COMP2003-7
  
  Pages: 47-54
- NAID
  110003178784
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-15500011
[Journal Article] A 2-Approximation Algorithm FSA+1 to (λ+1)-Edge-Connect a Specified Set of Vertices in a λ-Edge-Connected Graph2003
- Author(s)
  Satoshi Taoka
- Journal Title
  
  Proc.2003 IEEE International Symposium on Circuit and Systems
- NAID
  110002811930
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-15500011
[Journal Article] Maximum Weight Matching-Based Algorithms for κ-Edge-Connectivity Augmentation of a Graph2003
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Technical Report COMP2003-26
  
  Pages: 17-24
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-15500011
[Journal Article] Maximum Weight Matching-Based Algorithms for k-Edge-Connectivity Augmentation of a Graph2003
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Technical Report COMP2003-26
  
  Pages: 17-24
- NAID
  110003178767
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-15500011
[Journal Article] Experimental Evaluation of Node-Variable Selection Rules in PC Cluster-based Parallel Branch-and-Bound Algorithms2003
- Author(s)
  Satoshi Taoka
- Journal Title
  
  IEICE Technical Report COMP2003-7
  
  Pages: 47-54
- NAID
  110003178784
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-15500011
[Presentation] カンファレンスプログラム編成のための局所探索法の性能強化初期解生成と近傍交換2013
- Author(s)
  奥本政彦, 田岡智志, 渡邉敏正
- Organizer
  信学技報
- Place of Presentation
  大阪市
- Year and Date
  2013-01-23
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] A Distributed Algorithm for 2-Edge-Connectivity Augmentation Problem of a Connected Graph"2013
- Author(s)
  Satoshi Taoka, and Toshimasa Watanabe
- Organizer
  The 28th International Technical Conference on Circuits/Systems
- Place of Presentation
  Yeosu, Korea
- Year and Date
  2013-07-03
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] 通信ネットワークのトラフィックパスに基づく信頼性計算法の改良2013
- Author(s)
  田岡智志, 野口威, 渡邉敏正
- Organizer
  第26回回路とシステムワークショップ
- Place of Presentation
  淡路市
- Year and Date
  2013-07-30
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] ネットワークのトラフィックパスに基づく信頼性計算における要素分解順序の改良について2013
- Author(s)
  野口威, 田岡智志, 渡邉敏正
- Place of Presentation
  別府市
- Year and Date
  2013-01-29
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] 格子グラフ上の二重入れ子状矩形境界間を接続する互いに点素なパスについて"2013
- Author(s)
  花田英人, 高藤大介, 田岡智志, 渡邉敏正.
- Place of Presentation
  別府市
- Year and Date
  2013-01-29
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] Performance Comparison of Approximation Algorithms for the Minimum Weight Vertex Cover Problem2012
- Author(s)
  Satoshi Taoka
- Organizer
  2012 IEEE International Symposium on Circuit and Systems (ISCAS 2012)
- Place of Presentation
  韓国
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] フローネットワーク故障耐性のための頂点容量割り当て法の性能強化2012
- Author(s)
  坂本達哉, 田岡智志, 渡邉敏正
- Organizer
  第25回回路とシステムワークショップ
- Place of Presentation
  淡路市
- Year and Date
  2012-07-31
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] Performance Comparison of Approximation Algorithms for the Minimum Weight Vertex Cover Problem2012
- Author(s)
  Satoshi Taoka, Toshimasa Watanabe
- Organizer
  2012 IEEE International Symposium on Circuit and Systems
- Place of Presentation
  Soul, Korea
- Year and Date
  2012-05-23
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] Pseudo-polynomial Time Solvability for The Maximum Legal Firing Sequence Problem of Inhibitor-Arc Petri nets - Weighted Marked Graphs with Inhibitor Arcs2012
- Author(s)
  Satoru Ochiiwa, Satoshi Taoka, Toshimasa Watanabe
- Organizer
  The 27th International Technical Conference on Circuits/Systems
- Place of Presentation
  札幌市
- Year and Date
  2012-07-18
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] グラフ点彩色問題の発見的解法の性能比較2012
- Author(s)
  小新雄太, 田岡智志, 渡邉敏正.
- Place of Presentation
  新潟市
- Year and Date
  2012-03-09
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] 確率ネットワークにおける信頼性評価法の性能比較2012
- Author(s)
  田原将充, 坂本達哉, 田岡智志, 渡邉敏正
- Organizer
  気・情報関連学会中国支部第63回連合大会
- Place of Presentation
  松江市
- Year and Date
  2012-10-20
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] 点の非隣接性を考慮した最小重み点カバー問題解法2012
- Author(s)
  山崎雄太, 田岡智志, 渡邉敏正
- Organizer
  第25回回路とシステムワークショップ
- Place of Presentation
  淡路市
- Year and Date
  2012-07-31
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] 描画固定部分グラフを有するグラフの平面性2012
- Author(s)
  大野峻, 高藤大介, 田岡智志, 渡邉敏正.
- Organizer
  信学技報
- Place of Presentation
  福岡市
- Year and Date
  2012-01-20
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] Enhanced Algorithms for the Marking Construction Problem of Petri Nets based on Improvement of Finding Firing Sequeunces2011
- Author(s)
  吉岡篤人, 田岡智志, 渡邉敏正
- Organizer
  IEICE Tech. Rep
- Place of Presentation
  下関市
- Year and Date
  2011-01-21
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] カンファレンスプログラム編成のための局所探索法の改良2011
- Author(s)
  上原康史, 田岡智志, 渡邉敏正
- Place of Presentation
  那覇市
- Year and Date
  2011-03-07
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] カンファレンスプログラム編成のための局所探索法の改良2011
- Author(s)
  上原康史, 田岡智志, 渡邉敏正.
- Organizer
  第24回回路とシステムワークショップ
- Place of Presentation
  淡路市
- Year and Date
  2011-08-02
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] 確率的頂点容量を持つフローネットワークのコスト付き頂点容量割り当て問題の発見的解法2011
- Author(s)
  大和秀彰, 田岡智志, 渡邉敏正
- Organizer
  第24回回路とシステムワークショップ
- Place of Presentation
  淡路市
- Year and Date
  2011-08-02
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] 発火系列探索法の改良に基づいて性能強化されたペトリネットマーキング構成問題解法2011
- Author(s)
  吉岡篤人, 田岡智志, 渡邉敏正
- Organizer
  IEICE Tech.Rep., vol.110, no.370, CST2010-78, pp.103-108
- Place of Presentation
  山口県下関市
- Year and Date
  2011-01-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] 確率フローネットワークの頂点容量割り当て問題に対する発見的解法2011
- Author(s)
  大和秀彰, 田岡智志, 渡邉敏正
- Organizer
  信学技報
- Place of Presentation
  下関市
- Year and Date
  2011-01-21
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] カンファレンスプログラム編成のための局所探索法の改良2011
- Author(s)
  上原康史, 田岡智志, 渡邉敏正
- Organizer
  SIGAL, Vol.2011-AL-134, No.8
- Place of Presentation
  沖縄県那覇市
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] A Fast Algorithm for Augmenting Edge-Connectivity by One with Multipartition Constraints2011
- Author(s)
  Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe
- Organizer
  The 26th International Technical Conference on Circuits/Systems
- Place of Presentation
  Gyeogju, Korea
- Year and Date
  2011-06-20
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] A Simplified Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints2011
- Author(s)
  Tadachika OKI, Satoshi TAOKA, Toshimasa WATANABE
- Organizer
  The First International Workshop on Networking, Computing, Systems, and Software (NCSS)
- Place of Presentation
  吹田市
- Year and Date
  2011-12-02
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] Two Heuristic Algorithms for Minimizing Initial Markings of Timed Petri Nets2011
- Author(s)
  Satoru Ochiiwa, Satoshi Taoka, Toshimasa Watanabe.
- Organizer
  The 26th International Technical Conference on Circuits/Systems
- Place of Presentation
  Gyeogju, Korea
- Year and Date
  2011-06-20
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] 確率フローネットワークの頂点容量割り当て問題に対する発見的解法2011
- Author(s)
  大和秀彰, 田岡智志, 渡邉敏正
- Organizer
  信学技報, vol.110, No.370, CST2010-82, pp.127-132
- Place of Presentation
  山口県下関市
- Year and Date
  2011-01-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] A Fast Algorithm for (σ+1)-Edge-Connectivity Augmentation of a σ-Edge-Connected Graph with Multipartition Constraints2010
- Author(s)
  沖忠親, 田岡智志, 渡邉敏正
- Organizer
  IPSJ SIG Technical Report Vol.2010-AL-131 No.10, pp.1-8
- Place of Presentation
  北海道函館市
- Year and Date
  2010-09-22
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] σ辺連結 2 部グラフの(σ + 1)辺連結化のための高速アルゴリズム"2010
- Author(s)
  沖忠親, 田岡智志, 間島利也, 渡邉敏正
- Organizer
  第23回回路とシステム軽井沢ワークショップ
- Place of Presentation
  北佐久郡
- Year and Date
  2010-04-20
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints2010
- Author(s)
  沖忠親, 田岡智志, 渡邉敏正
- Organizer
  2nd International Workshop on Parallel and Distributed Algorithms and Applications (PDAA)
- Place of Presentation
  広島県東広島市
- Year and Date
  2010-11-19
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] Heuristic Extraction of a Maximum Induced Tree from a Graph2010
- Author(s)
  Hiroyuki Yoshida, Daisuke Takafuji, Satoshi Taoka, Toshimasa Watanabe
- Organizer
  the 23rd Workshop on Circuits and Systems in Karuizawa
- Place of Presentation
  北佐久郡
- Year and Date
  2010-04-20
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints2010
- Author(s)
  Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe
- Organizer
  2nd International Workshop on Parallel and Distributed Algorithms and Applications (PDAA)
- Place of Presentation
  東広島市
- Year and Date
  2010-11-19
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] Heuristic Algorithms for the Marking Construction Problem of Petri Nets2010
- Author(s)
  Satoshi Taoka
- Organizer
  Proc.2010 IEEE International Symposiumon Circuit and Systems(ISCAS 2010)
- Place of Presentation
  France
- Year and Date
  2010-05-31
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] Heuristic Algorithms for the Marking Construction Problem of Petri Nets2010
- Author(s)
  田岡智志, 渡邉敏正
- Organizer
  Proc.2010 IEEE International Symposium on Circuit and Systems (ISCAS 2010), pp.1344-1347
- Place of Presentation
  Paris France.
- Year and Date
  2010-05-31
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] カンファレンスプログラムの自動編成について2010
- Author(s)
  田岡智志
- Organizer
  第23回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2010-04-19
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] A Fast Algorithm for (δ+1)-Edge-Connectivity Augmentation of a δ-Edge-Connected Graph with Multipartition Constraints2010
- Author(s)
  Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe
- Organizer
  IPSJ SIG Technical Report
- Place of Presentation
  函館市
- Year and Date
  2010-09-22
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] 時間付きペトリネットにおける最小初期マーキング問題に対する発見的解法 TPM とTMDLO2010
- Author(s)
  落岩諭, 田岡智志, 渡邊敏正
- Organizer
  Tech. Rep. CST2010-40 IEICE of Japan
- Place of Presentation
  吹田市
- Year and Date
  2010-11-18
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] カンファレンスプログラムの自動編成について2010
- Author(s)
  畑守之, 田岡智志, 渡邉敏正
- Organizer
  第23回回路とシステム軽井沢ワークショップ, pp.215-220
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2010-04-19
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] k辺連結2部グラフの(k+1)辺連結化のための高速アルゴリズム2010
- Author(s)
  沖忠親, 田岡智志, 渡邉敏正
- Organizer
  IPSJ SIG Technical Report Vol.2010-AL-129 No.7
- Place of Presentation
  神奈川県川崎市
- Year and Date
  2010-03-05
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] 時間付きペトリネットにおける最小初期マーキング問題に対する発見的解法TPMとTMDLO2010
- Author(s)
  落岩諭, 田岡智志, 渡邉敏正
- Organizer
  Tech Rep.CST2010-40 IEICE of Japan, pp.13-18
- Place of Presentation
  大阪府吹田市
- Year and Date
  2010-11-18
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] Heuristic Extraction of a Maximum Induced Tree from a Graph2010
- Author(s)
  吉田浩之, 高藤大介, 田岡智志, 渡邉敏正
- Organizer
  Proc.the 23rd Workshop on Circuits and Systems in Karuizawa, pp.415-420
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2010-04-20
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] カンファレンスプログラムの自動編成について2010
- Author(s)
  畑守之, 田岡智志, 渡邉敏正
- Organizer
  第23回回路とシステム軽井沢ワークショップ
- Place of Presentation
  北佐久郡
- Year and Date
  2010-04-20
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] カンファレンスプログラムの自動編成について2010
- Author(s)
  田岡智志
- Organizer
  第23回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2010-04-19
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] Heuristic Algorithms for the Marking Construction Problem of Petri Nets2010
- Author(s)
  Satoshi Taoka, Toshimasa Watanabe
- Organizer
  2010 IEEE International Symposium on Circuit and Systems (ISCAS 2010)
- Place of Presentation
  Paris, France
- Year and Date
  2010-06-02
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] Heuristic Algorithms for the Marking Construction Problem of Petri Nets2010
- Author(s)
  Satoshi Taoka
- Organizer
  Proc.2010 IEEE International Symposium on Circuit and Systems (ISCAS 2010)
- Place of Presentation
  France
- Year and Date
  2010-05-31
- Data Source
  KAKENHI-PROJECT-22500029
[Presentation] σ辺連結2部グラフの(σ+1)辺連結化のための高速アルゴリズム2010
- Author(s)
  沖忠親, 田岡智志, 間島利也, 渡邊敏正
- Organizer
  第23回回路とシステム軽井沢ワークショップ, pp.404-409
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2010-04-20
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] MAX-LFS解法と後処理の改良により性能強化されたペトリネットのマーキング構成問題解法2009
- Author(s)
  石井稔久, 田岡智志, 渡邉敏正
- Organizer
  Tech.Rep.CST2008-44 IEICE of Japan, vol.108, No.415, pp.17-22
- Place of Presentation
  神奈川県横浜市
- Year and Date
  2009-01-29
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] Minimum Augmentation to Tri-Connect a Bi-Connected Graph with Upper Bounds on Vertex-Degree2009
- Author(s)
  間島利也, 田岡智志, 渡邉敏正
- Organizer
  Proc.2009 IEEE International Symposium on Circuit and Systems (ISCAS 2009)
- Place of Presentation
  Taipei Taiwan.
- Year and Date
  2009-05-27
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] MAX-LFS 解法と後処理の改良により性能強化されたペトリネットのマーキング構成問題解法2009
- Author(s)
  田岡智志
- Organizer
  第22回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2009-04-21
- Data Source
  KAKENHI-PROJECT-18700031
[Presentation] グラフ点彩色問題の分散分枝限定解法 ParaBSCに対するVNSに基づく性能強化2009
- Author(s)
  田岡智志
- Organizer
  第22回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2009-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] グラフ点彩色問題の分散分枝限定解法ParaBSCに対するVNSに基づく性能強化2009
- Author(s)
  道後幸寛, 田岡智志, 渡邊敏正
- Organizer
  第22回回路とシステム軽井沢ワークショップ,pp.516-521
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2009-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] Minimum Augmentation to Tri-Connect a Bi-Connected Graph with Upper Bounds on Vertex-Degree2009
- Author(s)
  間島利也, 田岡智志, 渡邉敏正
- Organizer
  Proc.the 22nd Workshop on Circuits and Systems in Karuizawa, pp.510-515
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2009-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] トークン供給フロー制御と競合トランジションに基づく後退操作によるペトリネット発火系列探索法の性能強化2009
- Author(s)
  波多野開悟, 田岡智志, 渡邉敏正
- Organizer
  Tech.Rep.CST2008-43 IEICE of Japan, vol.108, No.415, pp.11-16
- Place of Presentation
  神奈川県横浜市
- Year and Date
  2009-01-29
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] Heuristic Algorithms AADO and AMDLO for the Minimum Initial Marking Problem of Petri Nets2009
- Author(s)
  Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe
- Organizer
  Proc.the 22nd Workshop on Circuits and Systems in Karuizawa, pp.492-497
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2009-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] グラフの最大誘導木を抽出する発見的解法の点除去に基づく性能強化2009
- Author(s)
  吉田浩之, 高藤大介, 田岡智志, 渡邉敏正
- Organizer
  CAS2009-24,信学技報, Vol.109, No.199, pp.1-6
- Place of Presentation
  島県広島市
- Year and Date
  2009-09-24
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] MAX-LFS解法と後処理の改良により性能強化されたペトリネットのマーキング構成問題解法2009
- Author(s)
  田岡智志
- Organizer
  第22回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2009-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] MAX-LFS解法と後処理の改良により性能強化されたペトリネットのマーキング構成問題解法2009
- Author(s)
  石井稔久, 田岡智志, 渡邊敏正
- Organizer
  第22回回路とシステム軽井沢ワークショップ,pp.486-491
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2009-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] 抑止辺を持つペトリネットの発火系列問題の解法について2009
- Author(s)
  竹歳裕一郎, 落岩諭, 田岡智志, 山内雅弘, 高藤大介, 渡邉敏正
- Organizer
  CAS2008-140,信学技報, Vol.108, No.453, pp.217-222
- Place of Presentation
  岐阜県岐阜市
- Year and Date
  2009-03-03
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] グラフ点彩色問題の分散分枝限定解法ParaBSC に対するVNS に基づく性能強化2009
- Author(s)
  田岡智志
- Organizer
  第22回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2009-04-21
- Data Source
  KAKENHI-PROJECT-18700031
[Presentation] グラフ点彩色問題の分散分枝限定解法ParaBSCに対するVNSに基づく性能強化2009
- Author(s)
  道後幸寛, 田岡智志, 渡邉敏正
- Organizer
  Tech.Rep.CST2008-52 IEICE of Japan, vol.108, No.415, pp.61-66
- Place of Presentation
  神奈川県横浜市
- Year and Date
  2009-01-29
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] ペトリネットの発火系列問題の拡張とWebアプリケーション用汎用スケジューラの作成2009
- Author(s)
  中野雅章, 山内雅弘, 田岡智志, 渡邉敏正
- Organizer
  電子情報通信学会コンカレント研究会
- Place of Presentation
  愛知県名古屋市
- Year and Date
  2009-11-26
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] 最小重み点被覆問題に対する近似解法-計算機実験による性能比較-2008
- Author(s)
  國近拓也, 田岡智志, 渡邊敏正
- Organizer
  第21回回路とシステム軽井沢ワークショップ, pp.285-290
- Place of Presentation
  野県北佐久郡
- Year and Date
  2008-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] 最小重み点被覆問題に対する近似解法-計算機実験による性能比較-2008
- Author(s)
  田岡智志
- Organizer
  第21回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2008-04-21
- Data Source
  KAKENHI-PROJECT-18700031
[Presentation] グラフ点彩色問題解法の性能強化とその応用2008
- Author(s)
  田岡智志
- Organizer
  第21回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2008-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] A Linear Time Algorithm for Tri-connectivity Augmentation of Bi-connected Graphs with Upper Bounds on Vertex-Degree Increase2008
- Author(s)
  間島利也, 田岡智志, 渡邉敏正
- Organizer
  Proc.of the 21st Karuizawa Workshop on Circuits and Systems, pp.273-278
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2008-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] グラフ点彩色問題解法の性能強化とその応用2008
- Author(s)
  田岡智志
- Organizer
  第21回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2008-04-21
- Data Source
  KAKENHI-PROJECT-18700031
[Presentation] 最小重み点被覆問題に対する近似解法-計算機実験による性能比較2008
- Author(s)
  田岡智志
- Organizer
  第21回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2008-04-21
- Data Source
  KAKENHI-PROJECT-18700031
[Presentation] 最小重み点被覆問題に対する近似解法 -計算機実験による性能比較-2008
- Author(s)
  田岡智志
- Organizer
  第21回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2008-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] A Linear Time Algorithm for Tri-connectivity Augmentation of Bi-connected Graphs with Upper Bounds on Vertex-Degree Increase2008
- Author(s)
  間島利也, 田岡智志, 渡邉敏正
- Organizer
  Proc.of The 23rd International Technical Conference on Circuits/Systems, Computers and Communications, pp.313-316
- Place of Presentation
  山口県下関市
- Year and Date
  2008-07-08
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] グラフ点彩色問題解法の性能強化とその応用2008
- Author(s)
  田岡智志
- Organizer
  第21回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2008-04-21
- Data Source
  KAKENHI-PROJECT-18700031
[Presentation] グラフ点彩色問題解法の性能強化とその応用2008
- Author(s)
  岡田慎司, 田岡智志, 渡邊敏正
- Organizer
  第21回回路とシステム軽井沢ワークショップ, pp.279-284
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2008-04-21
- Data Source
  KAKENHI-PROJECT-20500015
[Presentation] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2007
- Author(s)
  Satoshi Taoka
- Organizer
  Proc. the 20th Workshop on Circuits and Systems in Karuizawa
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2007-04-23
- Data Source
  KAKENHI-PROJECT-18700031
[Presentation] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2007
- Author(s)
  Satoshi Taoka
- Organizer
  第20回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡軽井沢町
- Year and Date
  2007-04-23
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-18500014
[Presentation] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2007
- Author(s)
  Satoshi, Taoka
- Organizer
  Proc. the 20th Workshop on Circuits and Systems in Karuizawa
- Place of Presentation
  Nagano
- Year and Date
  2007-04-23
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-18500014
[Presentation] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem2007
- Author(s)
  Satoshi Taoka
- Organizer
  第20回回路とシステム軽井沢ワークショップ
- Place of Presentation
  長野県北佐久郡軽井沢町
- Year and Date
  2007-04-23
- Data Source
  KAKENHI-PROJECT-18700031
[Presentation] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem2006
- Author(s)
  Satoshi, Taoka
- Organizer
  Proc. the 19th Workshop on Circuits and Systems in Karuizawa
- Place of Presentation
  Nagano
- Year and Date
  2006-04-25
- Description
  「研究成果報告書概要(欧文)」より
- Data Source
  KAKENHI-PROJECT-18500014
[Presentation] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem2006
- Author(s)
  Satoshi Taoka
- Organizer
  Proc. the 19th Workshop on Circuits and Systems in Karuizawa
- Place of Presentation
  長野県北佐久郡
- Year and Date
  2006-04-25
- Data Source
  KAKENHI-PROJECT-18700031
[Presentation] Performance Comparison of Algorithms for the Dynamic Shortest Path Problem2006
- Author(s)
  Satoshi Taoka
- Organizer
  Proc. the 19th Workshop on Circuits and Systems in Karuizawa
- Place of Presentation
  長野県北佐久郡軽井沢町
- Year and Date
  2006-04-25
- Description
  「研究成果報告書概要(和文)」より
- Data Source
  KAKENHI-PROJECT-18500014

1. WATANABE Toshimasa (80112184)

# of Collaborated Projects: 3 results

# of Collaborated Products: 29 results
2. TAKAFUJI Daisuke (00314732)

# of Collaborated Projects: 3 results

# of Collaborated Products: 5 results

Taoka Satoshi 田岡 智志

TAOKA Satoshi 田岡 智志

田岡 智志 タオカ サトシ

Research Projects

Research Products

Co-Researchers

Development ofPractical Algorithms for Network Optimization Problems in order to Improve Reliability of Information NetworksPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Integrated Research on Connectivity of Graphs and its Applications

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Development of Practical Algorithms for Network Optimization Problems based on Computer ExperimentsPrincipal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

Integrated Research on Connectivity of Graphs

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

A study on Connectivity of Graphs and Its Applications

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

ネットワーク構成法における問題の解法の高速化および性能評価に関する研究Principal Investigator

Principal Investigator

Project Period (FY)

Research Category

Research Field

Research Institution

[Journal Article] A Distributed Algorithm for 2-Edge-Connectivity Augmentation Problem of a Connected Graph"2013

Author(s)

Journal Title

Data Source

[Journal Article] Computing-based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs2013

Author(s)

Journal Title

NAID

Data Source

[Journal Article] A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints2012

Author(s)

Journal Title

NAID

Data Source

[Journal Article] The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms2011

Author(s)

Journal Title

NAID

Data Source

[Journal Article] The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms2011

Author(s)

Journal Title

NAID

Data Source

[Journal Article] Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets2009

Author(s)

Journal Title

NAID

Data Source

[Journal Article] Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets2009

Author(s)

Journal Title

NAID

Data Source

[Journal Article] Enhancing PC Cluster-based Parallel Branch-and-Bound Algorithms for the Graph Goloring problem2008

Author(s)

Journal Title

Data Source

Taoka Satoshi 田岡智志

TAOKA Satoshi 田岡智志

田岡智志タオカサトシ