Development of algorithms for multiple and robust solution search and Their Applications to Knowledge-Base Optimization in Japanese-Braille Translation
Project/Area Number |
20700211
|
Research Category |
Grant-in-Aid for Young Scientists (B)
|
Allocation Type | Single-year Grants |
Research Field |
Sensitivity informatics/Soft computing
|
Research Institution | Kagoshima University |
Principal Investigator |
ONO Satoshi Kagoshima University, 理工学研究科(工学系), 助教 (90363605)
|
Project Period (FY) |
2008 – 2010
|
Project Status |
Completed (Fiscal Year 2010)
|
Budget Amount *help |
¥4,160,000 (Direct Cost: ¥3,200,000、Indirect Cost: ¥960,000)
Fiscal Year 2010: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2009: ¥2,600,000 (Direct Cost: ¥2,000,000、Indirect Cost: ¥600,000)
Fiscal Year 2008: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
|
Keywords | Ant Colony Optimization / Particle Swarm Optimization / ロバスト解探索 / 分散並列計算 / 日本語点字翻訳 / 最適化アルゴリズム / 群知能 / 複数解探索 / Ant Colony Otimization / Particle Swarm Otimization |
Research Abstract |
This research proposed algorithms which search for promising, quasi-optimal solutions in addition to optimal solutions, and which search for solutions robust against small perturbations of design variables. This research also showed that a problem of defining similarity metric in knowledge base construction for Japanese-Braille translation could be formulated as an optimization problem, and that the proposed algorithms could be applied to this problem and other problems.
|
Report
(4 results)
Research Products
(75 results)