A Survey on the Applications of Bee Colony Optimization Techniques
Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 8
Abstract
In this paper an overview of the areas where the Bee Colony Optimization (BCO) and its variants are applied have been given. Bee System was identified by Sato and Hagiwara in 1997 and the Bee Colony Optimization (BCO) was identified by Lucic and Teodorovic in 2001. BCO has emerged as a specialized class of Swarm Intelligence with bees as agents. It is an emerging field for researchers in the field of optimization problems because it provides immense problem solving scope for combinatorial and NP-hard problems. BCO is one of the benchmark systems portraying team work, collaborative work. BCO is a bottom-up approach of modeling where agents form global solution by optimizing the local solution.
Authors and Affiliations
Dr. Arvinder Kaur , Shivangi Goyal
Extraction of Radiology Reports using Text mining
In this paper, we propose a text mining system to extract and use the information in radiology reports. The system consists of three main modules: medical finding extractor, report and image retriever. The medical findin...
A Quantitative Measure for Object Oriented Design Approach for Large-Scale Systems
Object Oriented development methodology is a trend in software development for complex systems. The architecture of the application domain depends on the nature of problem statement in hand. Success depends on the overal...
A survey on Data Storage and Retrieval in Cloud Computing
This paper presents the survey on data storage and retrieval in cloud computing. In this paper the study on scope and security issues related to data storage and information retrieval in cloud computing is done. Data sto...
A GENETIC ALGORITHM FOR REGRESSION TEST CASE PRIORITIZATION USING CODE COVERAGE
Regression testing is a testing technique which is used to validate the modified software. The regression test suite is typically large and needs an intelligent method to choose those test cases which will detect maximum...
Efficient construction of Optimal Binary Search Trees using Data Preprocessing to improve Quality and Attribute Post computing to save Space and time through modified Dynamic Programming Technique
There are various methods of handling Optimal Binary search trees in order to improve the performance. One of the methods is Dynamic programming which incurs O(n3) time complexity to store involved computations in a tabl...