id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_rhgi3yz4jfaq7ev6lbeirq2c7u	Jiming Liu	Self-organized combinatorial optimization	2011	21	.pdf	application/pdf	8509	761	55	decentralized, self-organized algorithm for solving combinatorial optimization problems. In this paper, we present a self-organized computing approach to solving hard combinatorial In this paper, we present a self-organized computing approach to solving hard combinatorial microscopic characteristics of optimal solutions with respect to discrete state variables and local characteristics; Fitness network; Phase transition; Self-organized computing finding near-optimal solutions of NP-complete problems within a reasonable computational time. optimization, several decentralized, self-organized computing methods have been studied in recent the global fitness of a combinatorial solution can be represented as a function of distributed local fitness, and the optimal solution is equivalent to the microstate with the minimum sum of local analysis of optimal solutions based on the preceding definitions of discrete state variable and local For a given combinatorial optimization problem, the fitness network can be globally optimal solution '0011' in the bottom of the fitness network. present a self-organized computing method for solving combinatorial optimization problems.	./cache/work_rhgi3yz4jfaq7ev6lbeirq2c7u.pdf	./txt/work_rhgi3yz4jfaq7ev6lbeirq2c7u.txt