By Topic

Result Optimal Translation Sequence of a New Definition Form of Rough Communication

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
$33 $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

4 Author(s)

In rough communication, because each agent has communication to each other, the concept translated among multi-agents will loss some information, and this results in a less or rougher concept. With different translation sequences the amount of the missed knowledge is varied. A new definition form of rough communication is introduced. In order to get the translation sequence, in which the last agent taking part in new-rough communication gets maximum information, simulated annealing algorithm is used. Analysis and simulation of the algorithm demonstrate the effectiveness of the approach.

Published in:

Machine Learning and Cybernetics, 2007 International Conference on  (Volume:5 )

Date of Conference:

19-22 Aug. 2007