数理工学教室 テクニカルレポート 1994年
No | 著者 | contents |
94001 | Yutaka Matsumoto | On Optimization of Polling Policy Represented by Neural Network |
94002 | Yutaka Matsumoto | Improved Fairness of the pi-Persistent Protocol in Dynamic Environments |
94003 | Yasuyuki Nakamura, Futoshi Tominaga and Toyonori Munakata | Clustering behavior of time-delayed nearest-neighbor coupled oscillators |
94004 | Kiyotsugu Takaba, Naoki Morihira and Tohru Katayama | H∞ Control Using Descriptor Form: A J_Spectral Factorization Approach |
94005 | Satoru Ibaraki and Toshihide lbaraki | Partial Proximal Method of Multipliers for Convex Programming Problems |
94006 | Kiyotsugu Takaba and Tohru Katayama | A Model Matching Approach to Discrete-Time H∞ Filtering Problem |
94007 | Hiroshi Nagamochi, Kazuhiro Nishimura and Toshihide Ibaraki | Computing All Small Cuts in an Undirected Network |
94008 | Hiroyuki Kawano, Shojiro Nishio, Jiawei Han and Toshiharu Hasegawa | Control of Dynamic Environment by Knowledge Discovery and Active Database Techniques |
94009 | Norikazu Kawasaki, Hideaki Takagi, Yutaka Takahashi and Toshiharu Hasegawa | Waiting Time Analysis of Gated Mx/G/1 with Random Order of Service |
94010 | Kazuhisa Makino and Toshihide Ibaraki | The Maximum Latency and Identification of Positive Boolean Functions |
94011 | Hiroshi Nagamochi, Tadashi Ono and Toshihide Ibaraki | Implementing an Emcient Minimum Capacity Cut Algorithm |
94012 | Hideaki Harada, Zheng Sun and Hiroshi Nagamochi | An Exact Lower Bound on the Number of Cut-Sets |
94013 | Hiroshi Nagamochi, Naohisa Maeda and Toshihide Ibaraki | Approximate Algorithms for the Multiway Target Split Problem |
94014 | Mutsunori Yagiura and Toshihide Ibaraki | The Use of Dynamic Programming in Genetic Algorithms for Permutation Problems |
94015 | Kazuhisa Makino and Toshihide Ibaraki | Interior and Exterior Functions of Boolean Functions |
94016 | Hiroshi Nagamochi, Dao-zhi Zeng, Naohisa Kabutoya and Toshihide Ibaraki | Complexity of the Minimum Base Game on Matroids |
94017 | Hiroshi Nagamochi and Toshihide Ibaraki | A Faster Edge Splitting Algorithm in Multigraphs and Its Application to the Edge-Connectivity Augmentation Problem |
« 上へ戻る » |