In this note a strategy is presented that speeds up the computation of characteristic gets several times in many cases. We test the possibility of success for this strategy in the quasi-sense by 50 examples, where the strategy succeeds in 58 and fails in 23 of the 81 completed cases. The speed-up of the strategy, while successful, ranges from a few to hundred times, whereas in the failure case the computation may be slightly slowed down (not less than 0.6 times).
机构:
Department of Electronics and Informatics, Ryukoku University, OtsuDepartment of Electronics and Informatics, Ryukoku University, Otsu
Kimura M.
Saito K.
论文数: 0引用数: 0
h-index: 0
机构:
School of Administration and Informatics, University of Shizuoka, ShizuokaDepartment of Electronics and Informatics, Ryukoku University, Otsu
Saito K.
Ohara K.
论文数: 0引用数: 0
h-index: 0
机构:
Department of Integrated Information Technology, Aoyama Gakuin University, KanagawaDepartment of Electronics and Informatics, Ryukoku University, Otsu
Ohara K.
Motoda H.
论文数: 0引用数: 0
h-index: 0
机构:
Institute of Scientific and Industrial Research, Osaka University, Osaka
School of Computing and Information Systems, University of Tasmania, Hobart, 7005, TASDepartment of Electronics and Informatics, Ryukoku University, Otsu