By Topic

A general social intelligent algorithmic framework for packing problem with multi-processors

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

7 Author(s)
Junling Wang ; School of Mathematics and Statistics, Lanzhou University, P.R. China, 730000 ; Yi Yang ; Chenyang Zhao ; Li Liu
more authors

In this paper we establish a general social intelligent algorithmic framework for packing problem under the help of the conception of social computing. In this framework, packing problem can be solved intelligently, with the same asymptotic bounds by applying the existing packing algorithms. More precisely, our framework is designed to intelligently adopt the most proper one among all the given existing packing algorithms to pack the fixed given rectangle according to the present packing scenario. Moreover, for single packing processor, the algorithm created by our framework certainly turns out to be the algorithm the processor holds. But for multiple packing processors, it can construct and provide one social parallel intelligent packing algorithm based on all existing ones. This constructed algorithm certainly better than any algorithm involved, since the most proper algorithm is always adopted.

Published in:

2010 IEEE 2nd Symposium on Web Society

Date of Conference:

16-17 Aug. 2010