Graph based E-Government web service composition

Computer Science – Artificial Intelligence

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Nowadays, e-government has emerged as a government policy to improve the quality and efficiency of public administrations. By exploiting the potential of new information and communication technologies, government agencies are providing a wide spectrum of online services. These services are composed of several web services that comply with well defined processes. One of the big challenges is the need to optimize the composition of the elementary web services. In this paper, we present a solution for optimizing the computation effort in web service composition. Our method is based on Graph Theory. We model the semantic relationship between the involved web services through a directed graph. Then, we compute all shortest paths using for the first time, an extended version of the Floyd-Warshall algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Graph based E-Government web service composition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graph based E-Government web service composition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graph based E-Government web service composition will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-67344

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.