Yuji Kobayashi

31 papers A* 1B 2C 1Misc 1Journal 18Unranked 8
YearRankTypeTitle / Venue / Authors
2026 — conf
ODiN: Offline Reinforcement Learning with Diffusion Policies for Bilateral Negotiation Strategies.
ICAART (1)
Yuji Kobayashi, Katsuhide Fujita
2025 A* conf
Incident Diagnosing and Reporting System Based on Retrieval Augmented Large Language Model.
AAAI
Peng Yuan, Lu An Tang, Yanchi Liu, Yuji Kobayashi, Moto Sato, Haifeng Chen
2025 — conf
Pre-Trained Models and Fine-Tuning for Negotiation Strategies with End-to-End Reinforcement Learning.
ICAART (1)
Yuji Kobayashi, Katsuhide Fujita
2017 J jnl
A complete classification of continuous fractional operations on \(\mathbb {C}\).
Period. Math. Hung.
Yuji Kobayashi, Sin-Ei Takahasi, Makoto Tsukada
2015 — conf
A complex event processing for large-scale M2M services and its performance evaluations.
DEBS
Yuji Kobayashi, Kazuhiko Isoyama, Koji Kida, Hiroki Tagato
2014 C conf
Content Management System to Support Improve ment in Quality of Fitness Testing of Athletes.
ICCE
Yuji Kobayashi, Naka Gotoda
2013 J jnl
The Ulam Type Stability of a Generalized Additive Mapping and Concrete Examples.
Int. J. Math. Math. Sci.
Hiroyoshi Oda, Makoto Tsukada, Takeshi Miura, Yuji Kobayashi, Sin-Ei Takahasi
2012 — conf
A scalable complex event processing system and evaluations of its performance.
DEBS
Kazuhiko Isoyama, Yuji Kobayashi, Tadashi Sato, Koji Kida, Makiko Yoshida, Hiroki Tagato
2012 J jnl
The derivational complexity of string rewriting systems.
Theor. Comput. Sci.
Yuji Kobayashi
2007 J jnl
The Homological Finiteness Property FP
Int. J. Algebra Comput.
Yuji Kobayashi
2005 — conf
A novel lattice structure of M-channel paraunitary filter banks.
ISCAS (5)
Morio Ikehara, Yuji Kobayashi
2003 J jnl
Undecidable properties of monoids with word problem solvable in linear time.
Theor. Comput. Sci.
Masashi Katsura, Yuji Kobayashi
2003 J jnl
Undecidable properties of monoids with word problem solvable in linear time. Part II-- cross sections and homological and homotopical finiteness conditions.
Theor. Comput. Sci.
Masashi Katsura, Yuji Kobayashi, Friedrich Otto
2002 J jnl
Some Exact Sequences for The Homotopy (Bi-)Module af A Monoid.
Int. J. Algebra Comput.
Yuji Kobayashi, Friedrich Otto
2001 J jnl
On Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids.
Int. J. Algebra Comput.
Yuji Kobayashi, Friedrich Otto
2001 J jnl
Termination and derivational complexity of confluent one-rule string-rewriting systems.
Theor. Comput. Sci.
Yuji Kobayashi, Masashi Katsura, Kayoko Shikishima-Tsuji
2000 J jnl
Reconfigurable optical interconnections for parallel computing.
Proc. IEEE
Neil McArdle, Makoto Naruse, Haruyoshi Toyoda, Yuji Kobayashi, Masatoshi Ishikawa
2000 J jnl
Repetitiveness of languages generated by morphisms.
Theor. Comput. Sci.
Yuji Kobayashi, Friedrich Otto
2000 B conf
Undecidability Results for Monoids with Linear-Time Decidable Word Problems.
ISAAC
Masashi Katsura, Yuji Kobayashi, Friedrich Otto
1998 J jnl
Infinite Convergent String-Rewriting Systems and Cross-Sections for Finitely Presented Monoids.
J. Symb. Comput.
Friedrich Otto, Masashi Katsura, Yuji Kobayashi
1997 Misc conf
A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.
COCOON
Yuji Kobayashi, Friedrich Otto, Patrice Séébold
1997 — conf
Cross-Sections for Finitely Presented Monoids with Decidable Word Problems.
RTA
Friedrich Otto, Masashi Katsura, Yuji Kobayashi
1997 — conf
Finding all Solutions of a Hysteresis Associative Memory.
ICONIP (2)
Yuji Kobayashi, Toshimichi Saito, Kenya Jin'no
1997 J jnl
On Termination of Confluent One-Rule String-Rewriting Systems.
Inf. Process. Lett.
Kayoko Shikishima-Tsuji, Masashi Katsura, Yuji Kobayashi
1997 — conf
Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems - A Survey.
Advances in Algorithms, Languages, and Complexity
Friedrich Otto, Yuji Kobayashi
1997 B conf
Repetitiveness of D0L-Languages Is Decidable in Polynomial Time.
MFCS
Yuji Kobayashi, Friedrich Otto
1995 J jnl
A Finitely Presented Monoid Which Has Solvable Word Problem But Has No Regular Complete Presentation.
Theor. Comput. Sci.
Yuji Kobayashi
1994 J jnl
A Finiteness Condition for Rewriting Systems.
Theor. Comput. Sci.
Craig C. Squier, Friedrich Otto, Yuji Kobayashi
1993 J jnl
The Shuffle Algebra and its Derivations.
Theor. Comput. Sci.
Masashi Katsura, Yuji Kobayashi
1988 J jnl
Enumeration of irreducible binary words.
Discret. Appl. Math.
Yuji Kobayashi
1986 J jnl
Repetition-Free Words.
Theor. Comput. Sci.
Yuji Kobayashi