COOPERATIVE SOLUTION OF CONSTRAINT SATISFACTION PROBLEMS

被引:67
作者
CLEARWATER, SH
HUBERMAN, BA
HOGG, T
机构
[1] Dynamics of Computation Group, Xerox Palo Alto Research Center, Palo Alto
关键词
D O I
10.1126/science.254.5035.1181
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
It is widely believed that a group of cooperating agents engaged in problem solving can solve a task faster than either a single agent or the same group of agents working in isolation from each other. Nevertheless, little is known about the quantitative improvements that result from cooperation. A number of experimental results are presented on constraint satisfaction that both test the predictions of a theory of cooperative problem solving and assess the value of cooperation for this class of problems. These experiments suggest an alternative methodology to existing techniques for solving constraint satisfaction problems in computer science and distributed artificial intelligence.
引用
收藏
页码:1181 / 1183
页数:3
相关论文
共 8 条
[1]  
Engelmore R., 1988, BLACKBOARD SYSTEMS
[2]  
GASER L, 1989, DISTRIBUTED ARTIFICI, V2
[3]  
GLOVER DE, 1987, GENETIC ALGORITHMS S, P12
[4]   PHASE-TRANSITIONS IN ARTIFICIAL-INTELLIGENCE SYSTEMS [J].
HUBERMAN, BA ;
HOGG, T .
ARTIFICIAL INTELLIGENCE, 1987, 33 (02) :155-171
[5]   THE PERFORMANCE OF COOPERATIVE PROCESSES [J].
HUBERMAN, BA .
PHYSICA D, 1990, 42 (1-3) :38-47
[6]   THE SCIENTIFIC COMMUNITY METAPHOR [J].
KORNFELD, WA ;
HEWITT, CE .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1981, 11 (01) :24-33
[7]   COMBINATORIALLY IMPLOSIVE ALGORITHMS [J].
KORNFELD, WA .
COMMUNICATIONS OF THE ACM, 1982, 25 (10) :734-738
[8]  
Newell A, 1972, HUMAN PROBLEM SOLVIN, V104