Cart (Loading....) | Create Account
Close category search window
 

Research on Rough Sets Based Service Matchmaking Algorithm for Pervasive Computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Runcai Huang ; Coll. of Comput. Sci. & Technol., Donghua Univ., Shanghai ; Yiwen Zhuang ; Qiying Cao

Rough sets theory is applied to the service matchmaking algorithm for pervasive computing. The relevant service matchmaking algorithm model and method are presented in the paper. The decision system is built on the basis of the sample data from service resources. The evaluation indexes for service matchmaking are taken as the attributes to find out the important attributes that reflect the essential relationship of evaluation indexes and the attribute rules for service matchmaking. These reduction attributes and matchmaking rules are good to demonstrate the essential characteristics among the attributes in finite sample. Finally, the method is justified through attribute dependency.

Published in:

Information Science and Engineering, 2008. ISISE '08. International Symposium on  (Volume:1 )

Date of Conference:

20-22 Dec. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.