Presentation 2006/3/6
Study on parallel search with downscaled problem
Kazutoshi NAKAGAWA, Shuji NARAZAKI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) It is a well-known method that dividing given problem into some subproblems, and finding solution by solving its subproblems. In a dynamic situation such as multi-agent systems, it is more efficient method that they divide given problem during search depending on agents' situations and environment than they divide it in appropriate way before search. In this paper, we propose search algorithm finding a dividing point by solving subproblems that downscaled given problem, and dividing given problem with dividing point. We succeed about 121% speed-up by using this algorithm.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Parallel Search / Multi Agent System / Problem Reduction
Paper # KBSE2005-46
Date of Issue

Conference Information
Committee KBSE
Conference Date 2006/3/6(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Knowledge-Based Software Engineering (KBSE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Study on parallel search with downscaled problem
Sub Title (in English)
Keyword(1) Parallel Search
Keyword(2) Multi Agent System
Keyword(3) Problem Reduction
1st Author's Name Kazutoshi NAKAGAWA
1st Author's Affiliation Department of Electrical Engineering and Computer Science, Graduate School of Science and Technology, Nagasaki University()
2nd Author's Name Shuji NARAZAKI
2nd Author's Affiliation Department of Electrical Engineering and Computer Science, Graduate School of Science and Technology, Nagasaki University
Date 2006/3/6
Paper # KBSE2005-46
Volume (vol) vol.105
Number (no) 652
Page pp.pp.-
#Pages 5
Date of Issue