機械学習QSARの整数計画法に基づく逆解析法 von 永持, 仁, 朱, 見深, Ahmed, AZAM Naveed, 原口, 和也, 趙, 亮, 阿久津, 達也

Volltext

A new approach to the design of acyclic chemical compounds using skeleton trees and integer linear programming von Zhang, Fan, Zhu, Jianshen, Chiewvanichakorn, Rachaya, Shurbevski, Aleksandar, Nagamochi, Hiroshi, Akutsu, Tatsuya

Volltext

A New Integer Linear Programming Formulation to the Inverse QSAR/QSPR for Acyclic Chemical Compounds Using Skeleton Trees von Zhang, Fan, Zhu, Jianshen, Chiewvanichakorn, Rachaya, Shurbevski, Aleksandar, Nagamochi, Hiroshi, Akutsu, Tatsuya

Volltext

A Novel Method for Inference of Chemical Compounds of Cycle Index Two with Desired Properties Based on Artificial Neural Networks and Integer Programming von Zhu, Jianshen, Wang, Chenxi, Shurbevski, Aleksandar, Nagamochi, Hiroshi, Akutsu, Tatsuya

Volltext

Efficient enumeration of monocyclic chemical graphs with given path frequencies von Suzuki, Masaki, Nagamochi, Hiroshi, Akutsu, Tatsuya

Volltext

Enumerating tree-like chemical graphs with given upper and lower bounds on path frequencies von Shimizu, Masaaki, Nagamochi, Hiroshi, Akutsu, Tatsuya

Volltext

A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming von Azam, Naveed Ahmed, Zhu, Jianshen, Sun, Yanming, Shi, Yu, Shurbevski, Aleksandar, Zhao, Liang, Nagamochi, Hiroshi, Akutsu, Tatsuya

Volltext

パス構造グラフにおける納期違反コスト最小化選択的配達スケジューリング von 軽野, 義行, 永持, 仁, 内田, 潤

Volltext

Characterizing Output Locations of GSP Mechanisms to Obnoxious Facility Game in Trees von OOMINE, Morito, NAGAMOCHI, Hiroshi

Volltext

食品の袋詰め最適化問題に対する動的計画法 von 軽野, 義行, 永持, 仁, 大嶋, 芳行

Volltext

Some Reduction Procedure for Computing Pathwidth of Undirected Graphs von IKEDA, Masataka, NAGAMOCHI, Hiroshi

Volltext

タンク繰りにおける経路探索法 von 石井, 利昌, 永持, 仁, 西垣, 豊, 高橋, 健吾, 武田, 真人

Volltext

Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming von Imada, Tomoki, Ota, Shunsuke, Nagamochi, Hiroshi, Akutsu, Tatsuya

Volltext

P2Pシステムのための深さ最小木の構築について von 三輪 直樹, 趙 亮, 永持 仁

Volltext

グラフの連結度増大問題 von 永持, 仁

Volltext

Selective Vehicle Scheduling on Paths with a Due Date Involving Criterion von KARUNO, Yoshiyuki, NAGAMOCHI, Hiroshi, UCHIDA, Jun

Volltext

Algorithms and Computation: 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008 : Proceedings von Hutchison, David, Kanade, Takeo, Kittler, Josef

Volltext

A Dynamic Programming Approach for a Food Packing Problem von KARUNO, Yoshiyuki, NAGAMOCHI, Hiroshi, OHSHIMA, Yoshiyuki

Volltext

A Routing Algorithm on a Storage Tank System von ISHII, Toshimasa, NAGAMOCHI, Hiroshi, NISHIGAKI, Yutaka, TAKAHASHI, Kengo, TAKEDA, Makoto

Volltext

P2Pシステムのための深さ最小木の構築について von 三輪 直樹, 趙 亮, 永持 仁

Volltext