Bicchieri, C.: ¬The potential for the evolution of co-operation among web agents (1998)
0.01
0.0063583 = product of:
0.044508096 = sum of:
0.034519844 = weight(_text_:web in 2297) [ClassicSimilarity], result of:
0.034519844 = score(doc=2297,freq=4.0), product of:
0.09670874 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.029633347 = queryNorm
0.35694647 = fieldWeight in 2297, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.0546875 = fieldNorm(doc=2297)
0.009988253 = weight(_text_:information in 2297) [ClassicSimilarity], result of:
0.009988253 = score(doc=2297,freq=4.0), product of:
0.052020688 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.029633347 = queryNorm
0.1920054 = fieldWeight in 2297, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0546875 = fieldNorm(doc=2297)
0.14285715 = coord(2/14)
- 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
- Theme
- Web-Agenten
