| 2006 |
| 18 | EE | Daisuke Senzaki,
Hiroshi Mabuchi,
Goutam Chakraborty,
Masafumi Matsuhara:
Mobility Pattern Learning and Route Prediction Based Location Management in PCS Network.
AINA (2) 2006: 351-360 |
| 17 | EE | Hiroshi Mabuchi,
Kiyoshi Akama,
Toshihiro Wakatsuki:
Equivalent Transformation Rules as Components of Programs.
ICICIC (2) 2006: 282-287 |
| 16 | EE | Hidekatsu Koike,
Kiyoshi Akama,
Hiroshi Mabuchi:
Dynamic Interaction of Syntactic and Semantic Analyses Based on the Equivalent Transformation Computation Model.
JACIII 10(3): 302-311 (2006) |
| 15 | EE | Yoshinori Shigeta,
Kiyoshi Akama,
Hiroshi Mabuchi,
Hidekatsu Koike:
Converting Constraint Handling Rules to Equivalent Transformation Rules.
JACIII 10(3): 339-348 (2006) |
| 14 | EE | Itaru Takarajima,
Kiyoshi Akama,
Ikumi Imani,
Hiroshi Mabuchi:
Design of Nondeterministic Program Termination Based on the Equivalent Transformation Computation Model.
JACIII 10(3): 349-361 (2006) |
| 2005 |
| 13 | | Hiroshi Mabuchi,
Kiyoshi Akama,
Hidekatsu Koike,
Takahiko Ishikawa:
Correctness Proof for Equivalent Transformation of Equality Constraints on an Interval-Variable Domain.
IC-AI 2005: 627-636 |
| 2004 |
| 12 | EE | Daisuke Senzaki,
Hiroshi Mabuchi,
Goutam Chakraborty,
Masafumi Matsuhara:
Distance Based Location Management in Cellular PCS Network -a Critical Study.
AINA (2) 2004: 95-98 |
| 11 | EE | Daisuke Senzaki,
Goutam Chakraborty,
Masafumi Matsuhara,
Hiroshi Mabuchi:
Improvement of Paging Cost by Updating Using Paging Delay Divergence.
IWDC 2004: 502-507 |
| 2003 |
| 10 | EE | Takahiko Ishikawa,
Kiyoshi Akama,
Hiroshi Mabuchi:
How to Make Programs from Problem Descriptions in the Equivalent Transformation Paradigm.
JACIII 7(3): 260-267 (2003) |
| 9 | EE | Hiroshi Mabuchi,
Kiyoshi Akama,
Takahiko Ishikawa,
Hidekatsu Koike:
Integration of Syntactic Analysis and Semantic Interpretation Based on Equivalent Transformation.
JACIII 7(3): 306-314 (2003) |
| 2002 |
| 8 | | Hiroshi Mabuchi,
Kiyoshi Akama,
Takahiko Ishikawa,
Y. Yamamoto:
Framework for Synthesis by Unfolding of Declarative Programs.
IC-AI 2002: 1060-1066 |
| 7 | | Kiyoshi Akama,
Hiroshi Mabuchi,
Takahiko Ishikawa,
E. Boyd:
A Basic Framework for Infinite Computation.
IC-AI 2002: 1080-1086 |
| 2001 |
| 6 | EE | Kiyoshi Akama,
Hidekatsu Koike,
Hiroshi Mabuchi:
A Theoretical Foundation of Program Synthesis by Equivalent Transformation.
Ershov Memorial Conference 2001: 131-139 |
| 5 | EE | Kiyoshi Akama,
Hidekatsu Koike,
Hiroshi Mabuchi:
Equivalent Transformation by Safe Extension of Data Structures.
Ershov Memorial Conference 2001: 140-148 |
| 2000 |
| 4 | | Hiroshi Mabuchi,
Kiyoshi Akama,
Hidekatsu Koike,
Yoshinori Shigeta:
Synthesis of Conversion Rules by Expanding Knowledge Representation.
Artificial Intelligence and Soft Computing 2000: 434-440 |
| 3 | | Hiroshi Mabuchi,
Kiyoshi Akama,
Yoshinori Shigeta,
Hidekatsu Koike:
Semantic Interpretation by Rule-based Equivalent Transformation.
Artificial Intelligence and Soft Computing 2000: 472-478 |
| 2 | | Yoshinori Shigeta,
Kiyoshi Akama,
Hidekatsu Koike,
Hiroshi Mabuchi:
Unreachability for a Class of Rewriting Systems using Two Homomorphisms.
Artificial Intelligence and Soft Computing 2000: 494-500 |
| 1 | EE | Kiyoshi Akama,
Hiroshi Mabuchi,
Eiichi Miyamoto:
A theoretical foundation for solving "no-solution" problems by abstraction.
Systems and Computers in Japan 31(1): 1-10 (2000) |