論文誌
[1]  Satoshi Fujita, Akira Ohtsubo, and Masaya Mito, ``Extended Skip Graphs for Efficient Key Search in Peer-To-Peer Environment,'' Journal of Interconnection Networks (JOIN), vol. 8, no. 2, pp. 119-132, June 2007.
[2]  Shigeaki Tagashira, Masaya Mito, and Satoshi Fujita, ``A Generic Solver Based on Functional Parallelism for Solving Combinatorial Optimization Problems,'' IEICE Trans. Information and Systems, vol. E89-D, no. 6, pp. 1940-1947, June 2006.
[3]  Masaya Mito and Satoshi Fujita, ``On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions,'' Journal of Heuristics, vol. 10, no. 5, pp. 507-523, September 2004.
国際会議
[1]  Masaya Mito and Satoshi Fujita, ``Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction,'' In Computing and Combinatorics, 14th Annual International Conference, COCOON 2008, LNCS, vol. 5092, pp. 425-433, June 2008. (Dalian, China)
[2]  Masaya Mito and Satoshi Fujita, ``Connected Domatic Partition Problem on Directed Path Graphs,'' In 2007 Korea-Japan Joint Workshop on Algorithms and Computation, August 2007. (Gwangju, Korea)
[3]  Satoshi Fujita, Akira Ohtsubo, and Masaya Mito, ``Extended Skip Graphs for Efficient Key Search in P2p Environment,'' In Proc. the 8th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2005), pp. 256-261 , December 2005. (Las Vegas)
[4]  Shigeaki Tagashira, Masaya Mito, and Satoshi Fujita, ``Towards Generic Solver of Combinatorial Optimization Problems with Autonomous Agents in P2p Networks,'' In High-Performance Computing, 6th International Symposium, ISHPC 2005, LNCS, vol. 4759, pp. 152-163, September 2005. (Nara)
[5]  Satoshi Fujita, Shigeaki Tagashira, Chen Qiao, and Masaya Mito, ``Distributed Branch-And-Bound Scheme for Solving the Winner Determination Problem in Combinatorial Auctions,'' In Proc. the IEEE 19th International Conference on Advanced Information Networking and Applications (AINA 2005), pp. 661-666, March 2005. (Taipei)
[6]  Masaya Mito and Satoshi Fujita, ``On Heuristics for Solving Winner Determination Problem in Combinatorial Auctions,'' In Proc. the 2003 IEEE/WIC International Conference on Intelligent Agent Technology (IAT 2003), pp. 25-31 , October 2003. (Halifax, Canada)
研究会・全国大会等
[1]  水戸将弥, 藤田 聡, ``有向パスグラフの最大連結支配集合分割,'' 情報処理学会アルゴリズム研究会, no. 2008-AL-118, pp. 25-32, May 2008. (東京農工大学)
[2]  田頭茂明, 水戸将弥, 藤田 聡, ``P2P環境における機能並列性に着目した分枝限定法の評価,'' 情報処理学会システム評価研究会, no. 2005-EVA-015, pp. 7-12, November 2005. (京都大学)
[3]  大坪 陽, 水戸将弥, 藤田 聡, ``Kleinbergの理論を利用したskip graphの拡張について,'' ネットワーク生態学研究会,第1回サマースクール,ポスターセッション, August 2005. (のとふれあい文化センター)
[4]  Chen Qiao, Masaya Mito, Shigeaki Tagashira, and Satoshi Fujita, ``Parallel Branch-And-Bound Scheme for the Winner Determination Problem in Combinatorial Auctions,'' In 情報処理学会計算機アーキテクチャ研究会, no. 2004-ARC-160, pp. 23-28, November 2004. (北九州国際会議場)
[5]  中尾誠治, 水戸将弥, 田頭茂明, 藤田 聡, ``P2Pオーバレイネットワークにおけるプローブを用いた共有情報の範囲検索法,'' グループウェアとネットワークサービスワークショップ2004, no. 14, November 2004. (鬼怒川温泉)
[6]  水戸将弥, 田頭茂明, 藤田 聡, ``組合せオークションの勝者決定問題に対する並列分枝限定解法,'' 情報処理学会システム評価研究会, no. 2003-EVA-007, pp. 17-22, August 2003. (松江テルサ)
[7]  水戸将弥, 藤田 聡, ``組合せオークションの勝者決定問題に対する発見的解法,'' 情報処理学会アルゴリズム研究会, no. 2002-AL-088, pp. 43-50, January 2003. (国立情報学研究所)
[8]  水戸将弥, 藤田 聡, ``ユーザからの非明示的な要求の獲得手法の提案とその勤務表作成問題への応用,'' 情報処理学会ヒューマンコンピュータインタラクション研究会, no. 2001-HI-096, pp. 101-108, November 2001. (長崎大学)
修士論文
[1]  Masaya Mito, ``A Study on Heuristics for Solving Winner Determination Problem in Combinatorial Auctions,'' Master thesis, 広島大学大学院工学研究科情報工学専攻, 2003.

This site is maintained by Distributed System Laboratory.

PMAN 2.5.5 - Paper MANagement system / (C) 2002-2008, Osamu Mizuno / All rights reserved.