拐杖
发表于 2025-3-21 16:55:46
书目名称Data Management in Grid and Peer-to-Peer Systems影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0262865<br><br> <br><br>书目名称Data Management in Grid and Peer-to-Peer Systems影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0262865<br><br> <br><br>书目名称Data Management in Grid and Peer-to-Peer Systems网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0262865<br><br> <br><br>书目名称Data Management in Grid and Peer-to-Peer Systems网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0262865<br><br> <br><br>书目名称Data Management in Grid and Peer-to-Peer Systems被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0262865<br><br> <br><br>书目名称Data Management in Grid and Peer-to-Peer Systems被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0262865<br><br> <br><br>书目名称Data Management in Grid and Peer-to-Peer Systems年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0262865<br><br> <br><br>书目名称Data Management in Grid and Peer-to-Peer Systems年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0262865<br><br> <br><br>书目名称Data Management in Grid and Peer-to-Peer Systems读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0262865<br><br> <br><br>书目名称Data Management in Grid and Peer-to-Peer Systems读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0262865<br><br> <br><br>
悄悄移动
发表于 2025-3-21 22:54:37
http://reply.papertrans.cn/27/2629/262865/262865_2.png
Contracture
发表于 2025-3-22 02:27:06
Verification of General and Cyclic Covering Arrays Using Grid Computingre tested using a benchmark of CAs of variable strength. The main conclusion of the paper lies in the identification of the strengths and weakness of our algorithms (related to the values of the CA parameters).
有斑点
发表于 2025-3-22 07:58:39
A Profile-Based Aggregation Model in a Peer-To-Peer Information Retrieval Systems article we define a new method for automatic aggregation of results which mixes these categories by allowing each peer to construct knowledge about other peers’ relevance model using a learning method (Formal Concept Analysis). The idea is that each peer constructs relationships between past queries, returned documents and contributed peers.
neutral-posture
发表于 2025-3-22 11:58:15
http://reply.papertrans.cn/27/2629/262865/262865_5.png
虚弱
发表于 2025-3-22 15:05:08
http://reply.papertrans.cn/27/2629/262865/262865_6.png
虚弱
发表于 2025-3-22 20:19:19
http://reply.papertrans.cn/27/2629/262865/262865_7.png
Criteria
发表于 2025-3-22 22:00:12
Volker Ruitinga,Emma Chris Avramieaper we present a caching strategy for improving response time during a query execution using a catalog with information of neighbors cached items, allowing the interaction between different cache levels. A performance evaluation using grids is provided to verify the improvement achieved.
Obsessed
发表于 2025-3-23 02:53:05
https://doi.org/10.1007/978-1-4842-6264-1. More precisely, we describe methods to compute and approximate the mean time before the system loses data (.). We compare this metric for three placement policies: two of them ., in which the data is stored in logical peer neighborhoods, and one of them . in which fragments are parted uniformly at random among the different peers.
glowing
发表于 2025-3-23 06:50:49
Coding Examples from Simple to Complexre tested using a benchmark of CAs of variable strength. The main conclusion of the paper lies in the identification of the strengths and weakness of our algorithms (related to the values of the CA parameters).