Agent Networks: Topological and Clustering Characterization
暂无分享,去创建一个
[1] Toby Walsh,et al. Search in a Small World , 1999, IJCAI.
[2] Makoto Yokoo,et al. Local search for distributed SAT with complex local problems , 2002, AAMAS '02.
[3] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[4] J. Montoya,et al. Small world patterns in food webs. , 2002, Journal of theoretical biology.
[5] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[6] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[7] Makoto Yokoo,et al. Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.
[8] Karem A. Sakallah,et al. GRASP—a new search algorithm for satisfiability , 1996, ICCAD 1996.
[9] Pedro Barahona,et al. PSICO: Solving Protein Structures with Constraint Programming and Optimization , 2002, Constraints.
[10] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[11] Dale Schuurmans,et al. Local search characteristics of incomplete SAT procedures , 2000, Artif. Intell..
[12] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[13] Sharon L. Milgram,et al. The Small World Problem , 1967 .
[14] E. A. Hirsch,et al. UnitWalk: A New SAT Solver that Uses Local Search Guided by Unit Clause Elimination , 2005 .
[15] Yuan Yan Tang,et al. Multi-agent oriented constraint satisfaction , 2002, Artif. Intell..
[16] Bart Selman,et al. Evidence for Invariants in Local Search , 1997, AAAI/IAAI.
[17] Chu Min Li,et al. Look-Ahead Versus Look-Back for Satisfiability Problems , 1997, CP.
[18] Lada A. Adamic. The Small World Web , 1999, ECDL.
[19] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.
[20] Jiming Liu,et al. Distributed Problem Solving Without Communication - An Examination of Computationally Hard Satisfiability Problems , 2002, Int. J. Pattern Recognit. Artif. Intell..
[21] Edward A. Hirsch,et al. Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination , 2001, CP.
[22] Jiming Liu,et al. Multiagent SAT (MASSAT): Autonomous Pattern Search in Constrained Domains , 2002, IDEAL.
[23] Bart Selman,et al. Noise Strategies for Improving Local Search , 1994, AAAI.
[24] Jun Gu,et al. Efficient local search for very large-scale satisfiability problems , 1992, SGAR.