A granulating algorithm using global filled function
Published • Aug 1, 2008
Authors:,,
Yingtao Xu
Ying Zhang
Bo Zhu
Abstract
This paper studies how the concept of global optimization can be modeled in granular computing. The basic mathematical theory is filled function method, one of the effective deterministic global optimization methods. Such filled function method is viewed as a new computing architecture that is focus...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!