• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 47 matches

• 2023
• 
  Ahmed Bedawy, Kubo Ryuta, Naoto Yorino, Yoshifumi Zoka, Yutaka Sasaki, Satoshi Taoka:
  Target Voltage Control Approach for Active Distribution System Based on PV Active and Reactive Powers Nodal Prices. ISDCS 2023: 1-5
• 2019
• 
  Satoshi Taoka, Toshimasa Watanabe:
  Efficient Algorithms to Augment the Edge-Connectivity of Specified Vertices by One in a Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(2): 379-388 (2019)
• 2018
• 
  Satoshi Taoka, Tadachika Oki, Toshiya Mashima, Toshimasa Watanabe:
  Reduction of Constraints from Multipartition to Bipartition in Augmenting Edge-Connectivity of a Graph by One. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(2): 357-366 (2018)
• 2013
• 
  Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe:
  Two Heuristic Algorithms for the Minimum Initial Marking Problem of Timed Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(2): 540-553 (2013)
• 
  Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe:
  Computing-Based Performance Analysis of Approximation Algorithms for the Minimum Weight Vertex Cover Problem of Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 96-A(6): 1331-1339 (2013)
• 2012
• 
  Tadachika Oki, Satoshi Taoka, Toshiya Mashima, Toshimasa Watanabe:
  A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints. IEICE Trans. Inf. Syst. 95-D(3): 769-777 (2012)
• 
  Satoshi Taoka, Toshimasa Watanabe:
  Performance comparison of approximation algorithms for the minimum weight vertex cover problem. ISCAS 2012: 632-635
• 2011
• 
  Satoshi Taoka, Toshimasa Watanabe:
  The Marking Construction Problem of Petri Nets and Its Heuristic Algorithms. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(9): 1833-1841 (2011)
• 
  Xiang Yun, Xiaoming She, Lan Chen, Jianchi Zhu, Yu Jiang, Hidekazu Taoka, Katsutoshi Kusume, Satoshi Nagata:
  Investigation of Optimum Double Codebook Design for Downlink MIMO in LTE-A. VTC Spring 2011: 1-5
• 2010
• 
  Satoshi Taoka:
  Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(12): 2708 (2010)
• 
  Tadachika Oki, Satoshi Taoka, Toshimasa Watanabe:
  A Parallel Algorithm for 2-Edge-Connectivity Augmentation of a Connected Graph with Multipartition Constraints. ICNC 2010: 227-231
• 
  Satoshi Taoka, Toshimasa Watanabe:
  Heuristic algorithms for the marking construction problem of Petri nets. ISCAS 2010: 1344-1347
• 
  Katsutoshi Kusume, Guido Dietl, Tetsushi Abe, Hidekazu Taoka, Satoshi Nagata:
  System Level Performance of Downlink MU-MIMO Transmission for 3GPP LTE-Advanced. VTC Spring 2010: 1-5
• 2009
• 
  Satoru Ochiiwa, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe:
  Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(11): 2732-2744 (2009)
• 
  Toshimasa Watanabe, Satoshi Taoka:
  Efficiently Computing Minimal-Support Nonnegative Integer Invariants of Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(11): 2707-2716 (2009)
• 
  Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
  Minimum Augmentation to Tri-connect a Bi-connected Graph with Upper Bounds on Vertex-degree. ISCAS 2009: 2934-2937
• 2008
• 
  Daisuke Takafuji, Satoshi Taoka, Yasunori Nishikawa, Toshimasa Watanabe:
  Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(4): 1129-1139 (2008)
• 
  Satoshi Taoka, Daisuke Takafuji, Toshimasa Watanabe:
  Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 91-A(4): 1140-1149 (2008)
• 2007
• 
  Satoshi Taoka, Daisuke Takafuji, Takashi Iguchi, Toshimasa Watanabe:
  Performance Comparison of Algorithms for the Dynamic Shortest Path Problem. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 90-A(4): 847-856 (2007)
• 
  Toshiaki Taoka, Tesseki Kin, Hiroyuki Nakagawa, Makito Hirano, Masahiko Sakamoto, Takeshi Wada, Katsutoshi Takayama, Chatchada Wuttikul, Satoru Iwasaki, Satoshi Ueno, Kimihiko Kichikawa:
  Diffusivity and diffusion anisotropy of cerebellar peduncles in cases of spinocerebellar degenerative disease. NeuroImage 37(2): 387-393 (2007)
• 2006
• 
  Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe:
  Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase. IEICE Trans. Inf. Syst. 89-D(2): 751-762 (2006)
• 
  Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
  On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(4): 1042-1048 (2006)
• 
  Satoshi Taoka, Toshimasa Watanabe:
  Time Complexity Analysis of the Legal Firing Sequence Problem of Petri Nets with Inhibitor Arcs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(11): 3216-3226 (2006)
• 
  Satoshi Taoka, Kazuya Watanabe, Toshimasa Watanabe:
  Experimental Evaluation of Maximum-Supply Partitioning Algorithms for Demand-Supply Graphs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 89-A(4): 1049-1057 (2006)
• 
  Satoru Shimada, Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe:
  An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets. ISCAS 2006
• 2005
• 
  Takanori Fukuoka, Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
  A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(4): 954-963 (2005)
• 
  Toshiya Mashima, Satoshi Taoka, Toshimasa Watanabe:
  A 2-Approximation Algorithm to (k + 1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(5): 1290-1300 (2005)
• 
  Akihiro Taguchi, Atsushi Iriboshi, Satoshi Taoka, Toshimasa Watanabe:
  Siphon-Trap-Based Algorithms for Efficiently Computing Petri Net Invariants. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(4): 964-971 (2005)
• 
  Satoshi Taoka, Masahiro Yamauchi, Toshimasa Watanabe:
  Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 88-A(11): 3051-3061 (2005)
• 
  Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, Toshimasa Watanabe:
  Minimum augmentation to bi-connect specified vertices of a graph with upper bounds on vertex-degree. ISCAS (1) 2005: 752-755

skipping 17 more matches