Disolver : A Distributed Constraint Solver
暂无分享,去创建一个
[1] Lakhdar Sais,et al. Boosting Systematic Search by Weighting Constraints , 2004, ECAI.
[2] Youssef Hamadi. Cycle-cut decomposition and Log-based reconciliation , 2004 .
[3] Ian T. Foster,et al. MPICH-G2: A Grid-enabled implementation of the Message Passing Interface , 2002, J. Parallel Distributed Comput..
[4] Sheldon Howard Jacobson,et al. The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.
[5] Youssef Hamadi. Interleaved backtracking in distributed constraint networks , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.
[6] Pascal Van Hentenryck,et al. Localizer++: An Open Library for local Search , 2001 .
[7] Bart Selman,et al. Boosting Combinatorial Search Through Randomization , 1998, AAAI/IAAI.
[8] Bart Selman,et al. Algorithm Portfolio Design: Theory vs. Practice , 1997, UAI.
[9] Christian Bessiere,et al. Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.
[10] Rina Dechter,et al. Constraint Processing , 1995, Lecture Notes in Computer Science.
[11] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[12] Tad Hogg,et al. Better Than The Best: The Power of Cooperation , 1993 .
[13] Steven Minton,et al. Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..
[14] Pascal Van Hentenryck. Constraint satisfaction in logic programming , 1989, Logic programming.
[15] Leslie Lamport,et al. Distributed snapshots: determining global states of distributed systems , 1985, TOCS.
[16] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[17] Daniel Brélaz,et al. New methods to color the vertices of a graph , 1979, CACM.