|
|
| About site: Algorithms/Sorting and Searching - Search Algorithm |
Return to Computers also Computers
|
| About site: http://en.wikipedia.org/wiki/Search_algorithm |
Title: Algorithms/Sorting and Searching - Search Algorithm From Wikipedia, the free encyclopedia. Classification, summaries of the popular searching algorithms, links.
|
|
|
|
|
AceWallpapers_com_-_Fonts Listing of free fonts categorized alphabetically.
| Altair Brief article on the history of the Altair 8800.
| New_York_City,_NYCDAUG Digital Assistant Users Group (Formerly known as 'New York Palm Pilot User's Group').
| Network-based_intrusion-detection_systems IDS coverage from Network World, including an in-depth review of eight IDS products, tips for deployment and false alarm reduction, terminology glossary, and related news stories.
| LoBoS At the National Institute for Health. System configuration, status, benchmarks, links to software, news articles, and information for users.
| Consumer_Products_Group Offers options for website design, promotion, and hosting as well as advertising in business directories.
|
|
| Alexa statistic for http://en.wikipedia.org/wiki/Search_algorithm |
Please visit: http://en.wikipedia.org/wiki/Search_algorithm
|
| Related sites for http://en.wikipedia.org/wiki/Search_algorithm |
| Spirit_Offshore__Hosting Offshore web site hosting services for international business corporations - unlimited offshore e-mail accounts. | | Malware_Help_org News article database featuring articles submitted by users about malicious software threats. | | Projectfiles Security resource and firewall software for Linux systems. Essays on security, forum, news and software support. (Bash) [Linux] | | Google_Introduces_New_Features Press release about new services personalized Web search and Web alerts. Also explains the changes to the Google design and new search features. (March 29, 2004) | | Gallery Free, open source, photo management system. Photo management includes automatic thumbnail creation, image resizing, rotation, ordering, captioning, printing, and searching. | | PHP_Journal A blog that is a collection of my PHP notes, personal thoughts and tips gathered through author daily programming work. | | Introduction_to_the_Usages_of_Access_Databases Brief introduction to the usages of Access databases. | | PCI_40_/_DAS_16_Software_driver This is a device driver for an PCI40 Industry pack carrier board and FastDAC. | | Sense_of_Security Network auditing service. | | Large-Scale_Registration_of_Domains_with_Typographical_Errors A case study documenting over 5000 registrations by notorious cybersquatter John Zuccarini. Most are typographic variations on well-known names, most provide sexually-explicit content and popups, and | | comCables_com Provider of cables for computer printers, monitors, scsi adapters, and switchboxes for peripheral devices and networking equipment. | | RFC_1186 MD4 Message Digest Algorithm. R.L. Rivest. October 1990. | | Tek-Tips__Linux_(Client/Desktop)_Forum Technical support forums and mutual help system for computer professionals. Selling and recruiting forbidden. | | xnsdoc_XML_Schema_Documentation_Generator Generates XML Schema documentation in a JavaDoc like visualization. | | Rem_Web_Solutions Offer web site design, hosting, and maintenance services. Located in Waterloo, Ontario, Canada. | | In_House_Graphics Services offered include: design, advertising, logos, and photography. Based in Shreveport in Louisiana, United States. | | MediaWiz Web design, shopping carts, promotion, and hosting. | | Plotlib_Toolkit Extensible object-oriented graphing framework using the Java2D API, supporting XML, and with additional simplified classes for common requirements. [Open Source, GPL] | | Cadman_Designs Custom website design, hosting and search engine submittal. | | Sakic_Net Joomla! components and professional services Emir Sakic. Home of the SEF Advance component. |
|
This is websites2007.org cache of m/ as retrieved on 2008.08.21 websites2007.org's cache is the snapshot that we took of the page as we crawled the web. The page may have changed since that time.
|
Search algorithm - Wikipedia, the free encyclopedia /**/ Search algorithm From Wikipedia, the free encyclopedia Jump to: navigation, search  This article does not cite any references or sources.Please help improve this article by adding citations to reliable sources. Unverifiable material may be challenged and removed. (August 2007)In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. Most of the algorithms studied by computer scientists that solve problems are kinds of search algorithms. The set of all possible solutions to a problem is called the search space. Brute-force search or "naïve"/uninformed search algorithms use the simplest, most intuitive method of searching through the search space, whereas informed search algorithms use heuristic functions to apply knowledge about the structure of the search space to try to reduce the amount of time spent searching.Contents1 Uninformed search2 List search3 Tree search4 Graph search5 Informed search6 Adversarial search7 Constraint satisfaction8 Other types9 See also10 External links//[edit] Uninformed searchAn uninformed search algorithm is one that does not take into account the specific nature of the problem. As such, they can be implemented in general, and then the same implementation can be used in a wide range of problems thanks to abstraction. The drawback is that most search spaces are extremely large, and an uninformed search (especially of a tree) will take a reasonable amount of time only for small examples. As such, to speed up the process, sometimes only an informed search will do.[edit] List searchList search algorithms are perhaps the most basic kind of search algorithm. The goal is to find one element of a set by some key (perhaps containing other information related to the key). As this is a common problem in computer science, the computational complexity of these algorithms has been well studied. The simplest such algorithm is linear search, which simply examines each element of the list in order. It has expensive O(n) running time, where n is the number of items in the list, but can be used directly on any unprocessed list. A more sophisticated list search algorithm is binary search; it runs in O(log n) time. This is significantly better than linear search for large lists of data, but it requires that the list be sorted before searching (see sorting algorithm) and also be random access. Interpolation search is better than binary search for large sorted lists with fairly even distributions, but has a worst-case running time of O(n).Grover's algorithm is a quantum algorithm that offers quadratic speedup over the classical linear search for unsorted lists. However, it requires a currently non-existent quantum computer on which to run.Hash tables are also used for list search, requiring only constant time for search in the average case, but more space overhead and terrible O(n) worst-case search time. Another search based on specialized data structures uses self-balancing binary search trees and requires O(log n) time to search; these can be seen as extending the main ideas of binary search to allow fast insertion and removal. See associative array for more discussion of list search data structures.Most list search algorithms, such as linear search, binary search, and self-balancing binary search trees, can be extended with little additional cost to find all values less than or greater than a given key, an operation called range search. The glaring exception is hash tables, which cannot perform such a search efficiently.[edit] Tree searchTree search algorithms are the heart of searching techniques for structured data. These search trees of nodes, whether that tree is explicit or implicit (generated on the go). The basic principle is that a node is taken from a data structure, its successors examined and added to the data structure. By manipulating the data structure, the tree is explored in different orders - for instance, level by level (breadth-first search) or reaching a leaf node first and backtracking (depth-first search). Other examples of tree-searches include iterative-deepening search, depth-limited search, bidirectional search, and uniform-cost search.It should be realized that the efficiency of a tree search (compared to other search methods) is highly dependent upon the number and structure of nodes in relation to the number of items on that node. If there are a large number of items on one or more nodes, there may well be a requirement to utilize a specific different search technique for locating items within that particular set. In other words, a tree search is not mutually exclusive with any other search technique that may be used for specific sets. It is simply a method of reducing the number of relevant items to be searched (by whatever method) to those within certain branches of the tree. For example, the Greater London telephone directory may still contain entries for 20,000+ people whose surname is 'SMITH' belonging on a tree branch 'surnames beginning S'. The list of names may, or may not be, further subdivided by subscribers initials. A binary search may be appropriate to locate a particular person with forename 'Alias' and perhaps thereafter a linear search to locate a particular address.[edit] Graph searchMany of the problems in graph theory can be solved using graph traversal algorithms, such as Dijkstra's algorithm, Kruskal's algorithm, the nearest neighbour algorithm, and Prim's algorithm. These can be seen as extensions of the tree-search algorithms.[edit] Informed searchIn an informed search, a heuristic that is specific to the problem is used as a guide. A good heuristic will make an informed search dramatically out-perform any uninformed search.There are few prominent informed list-search algorithms. A possible member of that category is a hash table with a hashing function that is a heuristic based on the problem at hand. Most informed search algorithms explore trees[citation needed]. These include best-first search, and A*. Like the uninformed algorithms, they can be extended to work for graphs as well.[edit] Adversarial searchIn games such as chess, there is a game tree of all possible moves by both players and the resulting board configurations, and we can search this tree to find an effective playing strategy. This type of problem has the unique characteristic that we must account for any possible move our opponent might make. To account for this, game-playing computer programs, as well as other forms of artificial intelligence like machine planning, often use search algorithms like the minimax algorithm, search tree pruning, and alpha-beta pruning.[edit] Constraint satisfactionThis is a type of search which solves constraint satisfaction problems where, rather than looking for a path, the solution is simply a set of values assigned to a set of variables. Because the variables can be processed in any order, the usual tree search algorithms are too inefficient. Methods of solving constraint problems include combinatorial search and backtracking, both of which take advantage of the freedom associated with constraint problems. Common tricks or techniques involved in backtracking is Constraint propagation, which is a general form of Forward checking. Other local search algorithms, such as generic algorithm, which minimize the conflicts, also do a good job.[edit] Other typesString searching algorithms search for patterns within strings; one popular data structure that makes this more efficient is the suffix treeGenetic algorithms and Genetic programming use ideas from evolution as heuristics for reducing the search spaceSorting algorithms necessary for executing certain search algorithmsSimulated annealing is a probabilistic search algorithmRecommender systems also use statistical methods to rank results in very large data setsTabu search is a technique to avoid discrete searches getting stuck in local minimaFederated searchMinimax which can be highly optimized using alpha-beta pruning is an algorithm to search for good moves in zero-sum gamesTernary search[edit] See alsoSelection algorithmNo free lunch in search and optimizationSecretary problem is an online (ie sequentially presented) search problem with imperfect information, and a statistically optimal strategy.[edit] External linksA Field Guide to Genetic Programming by Poli, Langdon, and McPhee. Available as a free PDF, or in printed form from Lulu.com.Self-Guided Lesson on Uninformed Search Go to the Wikiversity and teach yourself to program an uninformed search solution.Retrieved from "http://en.wikipedia.org/wiki/Search_algorithm" Categories: Search algorithmsHidden categories: Articles lacking sources from August 2007 | All articles lacking sources | All articles with unsourced statements | Articles with unsourced statements since August 2008 Views Article Discussion Edit this page History Personal tools Log in / create account if (window.isMSIE55) fixalpha(); Navigation Main page Contents Featured content Current events Random article Search Interaction About Wikipedia Community portal Recent changes Contact Wikipedia Donate to Wikipedia Help Toolbox What links here Related changesUpload fileSpecial pages Printable version Permanent linkCite this page Languages Deutsch Ελληνικά Español Français Bahasa Indonesia Italiano Nederlands 日本語 Português Suomi Tiếng Việt   This page was last modified on 10 August 2008, at 19:55. All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.) Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a U.S. registered 501(c)(3) tax-deductible nonprofit charity. Privacy policy About Wikipedia Disclaimers if (window.runOnloadHook) runOnloadHook(); |
|
| |
From | Wikipedia, | the | free | encyclopedia. | Classification, | summaries | of | the | popular | searching | algorithms, | links. |
|
http://en.wikipedia.org/wiki/Search_algorithm
Search Algorithm 2008 August
dvd rental
dvd
From Wikipedia, the free encyclopedia. Classification, summaries of the popular searching algorithms, links.
Rules
|
© 2008 Internet Explorer 5+ or Netscape 6+
|
|
Recommended Sites: 1.
Arts -
Business -
Computers -
Games -
Health -
Home -
Kids and Teens -
News -
Recreation -
Reference -
Regional -
Science -
Shopping -
Society -
Sports -
World
Miss Gallery
- Top Anime Hentai
- DVD rental by mail
- Mortgage Calculator - Payday Loan - Wire Transfer - Credit Cards - Myspace Codes
|
