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

Genetic search based on multiple mutations

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)
Milutinovic, V. ; Belgrade Univ., Serbia ; Cvetkovic, D. ; Mirkovic, J.

Because of the fast growth in the quantity and variety of Web sites, quickly and efficiently retrieving information on the Internet is becoming increasingly difficult. Searches often result in a huge number of documents, many of which are completely unrelated to what the users are looking for. The paper considers how genetic search algorithms enable intelligent and efficient Internet searches. They are especially useful when the search space is relatively large

Published in:

Computer  (Volume:33 ,  Issue: 11 )

Date of Publication:

Nov 2000

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.