Analysis of Iterative Algorithms for MAX-XORSAT problems
Project/Area Number |
22500136
|
Research Category |
Grant-in-Aid for Scientific Research (C)
|
Allocation Type | Single-year Grants |
Section | 一般 |
Research Field |
Intelligent informatics
|
Research Institution | Hiroshima City University |
Principal Investigator |
MIMURA Kazushi 広島市立大学, 情報科学研究科, 准教授 (40353297)
|
Co-Investigator(Renkei-kenkyūsha) |
WATANABE Osamu 東京工業大学, 大学院・情報理工学研究科, 教授 (80158617)
|
Project Period (FY) |
2010 – 2012
|
Project Status |
Completed (Fiscal Year 2012)
|
Budget Amount *help |
¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2011: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2010: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
Keywords | 充足可能性問題 / 経路積分法 / ダイナミクス / 反復解法 / 反復過程 / アルゴリズム / 空洞法 / 反復アルゴリズム |
Research Abstract |
We have analysed an iterative algorithm for MAX-XORSAT, which is defined on a sparse hypergraph, by the generating functional analysis and have obtained an analytical solution to this problem. Introducing a certain assumption, we have also had a stationary property. These results guarantee its performance.
|
Report
(4 results)
Research Products
(33 results)