TY - GEN
T1 - Efficiency of emergent constraint satisfaction in small-world and random agent networks
AU - Jin, Xiaolong
AU - Liu, Jiming
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2003
Y1 - 2003
N2 - In this paper, we study the efficiency of emergent constraint satisfaction in small-world and random agent networks. We find that emergent constraint satisfaction in a small-world network is less efficient than in some other networks (e.g., regular networks). Further, we find that this finding holds in almost all random networks. Based on these observations, we study the relationship between the efficiency of emergent constraint satisfaction and the randomness of the corresponding network from which the constraint satisfaction problem is generated.
AB - In this paper, we study the efficiency of emergent constraint satisfaction in small-world and random agent networks. We find that emergent constraint satisfaction in a small-world network is less efficient than in some other networks (e.g., regular networks). Further, we find that this finding holds in almost all random networks. Based on these observations, we study the relationship between the efficiency of emergent constraint satisfaction and the randomness of the corresponding network from which the constraint satisfaction problem is generated.
UR - http://www.scopus.com/inward/record.url?scp=44149109978&partnerID=8YFLogxK
M3 - Conference proceeding
AN - SCOPUS:44149109978
SN - 0769519318
SN - 9780769519319
T3 - Proceedings - IEEE/WIC International Conference on Intelligent Agent Technology, IAT'03
SP - 304
EP - 310
BT - Proceedings - IEEE/WIC International Conference on Intelligent Agent Technology, IAT'03
T2 - 2003 IEEE/WIC International Joint Conference on Intelligent Agent Technology and Web Intelligence, IAT'03 and WI'03
Y2 - 13 October 2003 through 17 October 2003
ER -