Some aspects of the parallel and distributed iterative algorithms—a survey
Automatica (Journal of IFAC)
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Adaptive on-line page importance computation
WWW '03 Proceedings of the 12th international conference on World Wide Web
The Eigentrust algorithm for reputation management in P2P networks
WWW '03 Proceedings of the 12th international conference on World Wide Web
Distributed Pagerank for P2P Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
A Peer-to-Peer Framework for Web Service Discovery with Ranking
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Reputation = f(User Ranking, Compliance, Verity)
ICWS '04 Proceedings of the IEEE International Conference on Web Services
QoS computation and policing in dynamic web service selection
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Discovering and ranking web services with BASIL: a personalized approach with biased focus
Proceedings of the 2nd international conference on Service oriented computing
ACM Transactions on Internet Technology (TOIT)
WWW '05 Proceedings of the 14th international conference on World Wide Web
Page quality: in search of an unbiased web ranking
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Computing pagerank in a distributed internet search system
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
QoS-Based service selection and ranking with trust and reputation management
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Usage-based ranking of distributed XML data
Proceedings of the 2008 ACM symposium on Applied computing
Collaborative cache based on path scores
WISE'07 Proceedings of the 8th international conference on Web information systems engineering
| Hi-index | 0.00 |
The number of services on the web is growing every day and finding useful and efficient ranking methods for services has become an important issue in modern web applications In this paper we present a link-based importance model and efficient algorithms for distributed services collaborating through service calls We adapt the PageRank algorithm and define a service importance that reflects its activity and its contribution to the quality of other services.