Simple but Efficient Method for Parallel Execution of State Space Search
スポンサーリンク
概要
- 論文の詳細を見る
The parallelization techniques used in the conventional computer technology need the overhead with respect to the synchronization cost. Moreover it is difficult to achieve a high speed- up ratio in general. On the other hand, turning to our brains, although they achieve high-speed information processing using only low-speed neurons, it is hard to imagine such parallelization takes place in our brains. Are there any simple and efficient parallelization techniques? In this paper we discuss about such parallelization technique for state pace search problem. We also prove a basic theorem about this parallelization, and show a simple guideline of using this technique. Although the neural network is inherently a massively parallel algorithm, we can realize the parallelization of neural networks, namely the parallelization of massively parallel, by using the proposed technique.
- バイオメディカル・ファジィ・システム学会の論文
- 2008-10-11
著者
関連論文
- 9P-E-5 Using the Internal Rewards for a Mobile Robot to Survive and Perform a Task Effectively.(Room E International session)
- Controlling the Diversive and Specific Exploration in Solving Disjunctive Linear Constraint Satisfaction Problem(Contribution to 21 Century Intelligent Technologies and Bioinformatics)
- A Continuous Valued Neural Network with a New Evaluation Function of Degree of Unsatisfaction for Solving CSP(Biocybernetics, Neurocomputing)
- Lagrange Neural Network for Solving Constraint Satisfaction Problem
- Parallel Execution of Neural Networks for Solving Satisfiability Problem
- Simple but Efficient Method for Parallel Execution of State Space Search
- Lagrangian Method for Solving Software-MCU Assignment Problem in Car Electronic System Design