loading...
Efficiency of Emergent Constraint Satisfaction in Small-world and Random Agent Networks
Halifax, Canada October 13-October 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IAT.2003.12410832003 IEEE/WIC International Conferenc ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Xiaolong Jin, Hong Kong Baptist University
Jiming Liu, Hong Kong Baptist University
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.
Citation:
Xiaolong Jin, Jiming Liu, "Efficiency of Emergent Constraint Satisfaction in Small-world and Random Agent Networks," iat, pp.304, 2003 IEEE/WIC International Conference on Intelligent Agent Technology (IAT'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.