Bicchieri, C.: ¬The potential for the evolution of co-operation among web agents (1998)
0.03
0.03498798 = product of:
0.10496393 = sum of:
0.10496393 = product of:
0.1574459 = sum of:
0.11574978 = weight(_text_:network in 2297) [ClassicSimilarity], result of:
0.11574978 = score(doc=2297,freq=6.0), product of:
0.19402927 = queryWeight, product of:
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.043569047 = queryNorm
0.59655833 = fieldWeight in 2297, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
4.4533744 = idf(docFreq=1398, maxDocs=44218)
0.0546875 = fieldNorm(doc=2297)
0.041696113 = weight(_text_:29 in 2297) [ClassicSimilarity], result of:
0.041696113 = score(doc=2297,freq=2.0), product of:
0.15326229 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.043569047 = queryNorm
0.27205724 = fieldWeight in 2297, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.0546875 = fieldNorm(doc=2297)
0.6666667 = coord(2/3)
0.33333334 = coord(1/3)
- Abstract
- In building intelligent network agents, computer scientists may employ a variety of different design strategies, and their design decisions can have a significant effect on the ultimative nature of network interactions. Focuses on a particular design question, the multiple-access problem: if an agent seeking a piece of information knows of several sites that have, or might have, that information, how many queries should it issue, and when? Provides a formal analysis that demonstrates the viability of cooperative responses th this question under certain assumptions. discusses the limitations of this analysis and presents the results of experiments done using a genetic-algorithms approach in which simulated network agents 'evolve' cooperative strategies under less restrictive assumptions tham those made in the formal analysis
- Source
- International journal of human-computer studies. 48(1998) no.1, S.9-29
