On Optimality Condition of Complex Systems: Computational Evidence Export

@misc{citeulike:325806, abstract = {A general condition determining the optimal performance of a complex system has not yet been found and the possibility of its existence is unknown. To contribute in this direction, an optimization algorithm as a complex system is presented. The performance of the algorithm for any problem is controlled as a convex function with a single optimum. To characterize the performance optimums, certain quantities of the algorithm and the problem are suggested and interpreted as their complexities. An optimality condition of the algorithm is computationally found: if the algorithm shows its best performance for a problem, then the complexity of the algorithm is in a linear relationship with the complexity of the problem. The optimality condition provides a new perspective to the subject by recognizing that the relationship between certain quantities of the complex system and the problem may determine the optimal performance.}, archivePrefix = {arXiv}, author = {Korotkikh, Victor and Korotkikh, Galina and Bond, Darryl}, citeulike-article-id = {325806}, citeulike-linkout-0 = {http://arxiv.org/abs/cs.CC/0504092}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs.CC/0504092}, day = {23}, eprint = {cs.CC/0504092}, keywords = {algorithms, complexity-theory}, month = {Apr}, posted-at = {2005-09-19 00:12:16}, priority = {2}, title = {On Optimality Condition of Complex Systems: Computational Evidence}, url = {http://arxiv.org/abs/cs.CC/0504092}, year = {2005} }

TY - ELEC ID - citeulike:325806 L3 - citeulike-article-id:325806 N2 - A general condition determining the optimal performance of a complex system has not yet been found and the possibility of its existence is unknown. To contribute in this direction, an optimization algorithm as a complex system is presented. The performance of the algorithm for any problem is controlled as a convex function with a single optimum. To characterize the performance optimums, certain quantities of the algorithm and the problem are suggested and interpreted as their complexities. An optimality condition of the algorithm is computationally found: if the algorithm shows its best performance for a problem, then the complexity of the algorithm is in a linear relationship with the complexity of the problem. The optimality condition provides a new perspective to the subject by recognizing that the relationship between certain quantities of the complex system and the problem may determine the optimal performance. TI - On Optimality Condition of Complex Systems: Computational Evidence KW - algorithms KW - complexity-theory AU - Korotkikh, Victor AU - Korotkikh, Galina AU - Bond, Darryl PY - 2005/Apr/23/ UR - http://arxiv.org/abs/cs.CC/0504092 ER -