清楚明确 发表于 2025-3-21 20:00:25

书目名称Agents and Peer-to-Peer Computing影响因子(影响力)<br>        http://figure.impactfactor.cn/if/?ISSN=BK0151252<br><br>        <br><br>书目名称Agents and Peer-to-Peer Computing影响因子(影响力)学科排名<br>        http://figure.impactfactor.cn/ifr/?ISSN=BK0151252<br><br>        <br><br>书目名称Agents and Peer-to-Peer Computing网络公开度<br>        http://figure.impactfactor.cn/at/?ISSN=BK0151252<br><br>        <br><br>书目名称Agents and Peer-to-Peer Computing网络公开度学科排名<br>        http://figure.impactfactor.cn/atr/?ISSN=BK0151252<br><br>        <br><br>书目名称Agents and Peer-to-Peer Computing被引频次<br>        http://figure.impactfactor.cn/tc/?ISSN=BK0151252<br><br>        <br><br>书目名称Agents and Peer-to-Peer Computing被引频次学科排名<br>        http://figure.impactfactor.cn/tcr/?ISSN=BK0151252<br><br>        <br><br>书目名称Agents and Peer-to-Peer Computing年度引用<br>        http://figure.impactfactor.cn/ii/?ISSN=BK0151252<br><br>        <br><br>书目名称Agents and Peer-to-Peer Computing年度引用学科排名<br>        http://figure.impactfactor.cn/iir/?ISSN=BK0151252<br><br>        <br><br>书目名称Agents and Peer-to-Peer Computing读者反馈<br>        http://figure.impactfactor.cn/5y/?ISSN=BK0151252<br><br>        <br><br>书目名称Agents and Peer-to-Peer Computing读者反馈学科排名<br>        http://figure.impactfactor.cn/5yr/?ISSN=BK0151252<br><br>        <br><br>

Endearing 发表于 2025-3-21 20:55:32

Unstructured Peer-to-Peer Networks: Topological Properties and Search Performancently on developing robust self-organizing P2P topologies that support efficient search. In this paper we discuss four structured and unstructured P2P models (CAN, Chord, PRU, and Hypergrid) and three characteristic search algorithms (BFS, k-Random Walk, and GAPS) for unstructured networks. We report

是贪求 发表于 2025-3-22 01:44:34

http://reply.papertrans.cn/16/1513/151252/151252_3.png

Solace 发表于 2025-3-22 05:22:54

DiST: A Scalable, Efficient P2P Lookup Protocol formulation of the problem solution, each data item is mapped to a key; every peer stores data items corresponding to a contiguous range of keys, and locating an item requires identifying the host that holds that item’s key. Here we describe Distributed Search Tree (DiST), a distributed lookup prot

极微小 发表于 2025-3-22 12:22:23

A Policy for Electing Super-Nodes in Unstructured P2P Networksthe search operations and the exemplary dependability, have been found to be much less scalable than first expected. The flooding protocol, which is used for the discovery of peers and for the main operation of searching, seems to be responsible for this weakness. The adoption of some major improvem

Moderate 发表于 2025-3-22 13:32:12

http://reply.papertrans.cn/16/1513/151252/151252_6.png

身心疲惫 发表于 2025-3-22 20:34:50

http://reply.papertrans.cn/16/1513/151252/151252_7.png

Infinitesimal 发表于 2025-3-23 00:36:17

Permission and Authorization in Policies for Virtual Communities of Agentsnts can play both the role of resource consumers and the role of resource providers. Moreover, the agents remain in control of their resources, and therefore we distinguish between the authorization to access a resource given by the virtual community and the permission to do so issued by the resourc

gonioscopy 发表于 2025-3-23 05:14:43

On Exploiting Agent Technology in the Design of Peer-to-Peer Applications in the design of applications ranging from high-capacity file sharing and global scale distributed computing to business team-ware. The objective of this paper is to outline a number of areas in which Agent techniques for the management of . such as decision making or fair trading amongst autonomou

CT-angiography 发表于 2025-3-23 05:41:13

Peer-to-Peer Semantic Integration of XML and RDF Data Sourcesose a P2P data management framework named PEPSINT that semantically integrates heterogeneous XML and RDF data sources, using a hybrid architecture and a global-as-view approach. Our focus is on the query processing techniques over heterogeneous data. Queries in PEPSINT are expressed in XQuery and in
页: [1] 2 3 4 5 6 7
查看完整版本: Titlebook: Agents and Peer-to-Peer Computing; Third International Gianluca Moro,Sonia Bergamaschi,Karl Aberer Conference proceedings 2005 Springer-Ve