Search results
Jump to navigation
Jump to search
Page title matches
- 40 bytes (3 words) - 18:20, 12 June 2018
Page text matches
- In [[operations research]], the area in which online algorithms are developed is called [[online optimization]]. As an example, consider the [[sorting algorithms]] [[selection sort]] and [[insertion sort]]: selection sort repeatedly sele ...6 KB (842 words) - 15:16, 4 December 2025
- ...=t7RDjagG1FAC&pg=PA498 |language=en}}</ref> More general phonetic matching algorithms take articulatory features into account <ref>Ladefoged, Peter. [https://acl ...ny applications, and one of the early use cases has been that of trademark search to ensure that newly registered trade marks do not risk infringing on exist ...6 KB (800 words) - 07:36, 19 December 2025
- ...bscribers to have [[telephone number]]s independent of switch codes. Flood search routing provides the highest probability that a [[telephone call]] will go Flood search routing is used in military telecommunication systems, such as the [[mobile ...2 KB (278 words) - 15:52, 14 June 2020
- {{short description|Any algorithm which solves the search problem}} ...thin particular [[data structure]], or calculated in the [[Feasible region|search space]] of a problem domain, with [[Continuous or discrete variable|either ...12 KB (1,627 words) - 07:21, 9 December 2025
- ...orithms are impractical without [[random access]]. On the other hand, some algorithms, typically those that do not have index, require only sequential access, su ...4 KB (653 words) - 01:10, 24 January 2026
- ==Algorithms and implementations== When a police officer claims to have done a "random .. door-to-door" search, there is a certain expectation that members of a jury will have.<ref> ...4 KB (563 words) - 11:34, 12 May 2026
- {{Distinguish|Line search}}{{short description|Sequentially looking in an array}} |class=[[Search algorithm]] ...9 KB (1,376 words) - 13:42, 18 April 2026
- ...al websites or [[intranet]]s may use a [[back-of-the-book index]], while [[search engines]] usually use keywords and [[Metadata (computing)|metadata]] to pro ...r web site can be retrieved with a list. This method is commonly used by [[search engine indexing]].<ref>{{Cite web|title = Indexing the Web {{!}} American S ...3 KB (417 words) - 04:25, 10 October 2025
- {{Short description|Measures of how efficiently algorithms use resources}} ...r under optimal conditions. For example, the best case for a simple linear search on a list occurs when the desired element is the first element of the list. ...13 KB (1,983 words) - 01:14, 9 December 2025
- * [[Organic search]], search results through unpaid search engine listings, rather than through paid advertisements ...]], search engine which uses a combination of human operators and computer algorithms ...3 KB (439 words) - 22:42, 23 October 2022
- *[[Disruption (of schema)]], in the field of computer genetic algorithms {{canned search|disruption}} ...2 KB (208 words) - 21:26, 1 April 2025
- {{Short description|Algorithm to search the nodes of a graph}} |class=[[Search algorithm]] ...14 KB (2,117 words) - 21:26, 14 May 2026
- {{for|wildcard characters within the Wikipedia search engine|Help:Wildcard|selfref=y}} ...<ref>{{cite web| last=Cantatore| first=Alessandro| title=Wildcard matching algorithms| date=Apr 25, 2003| url=http://xoomer.virgilio.it/acantato/dev/wildcard/wil ...6 KB (911 words) - 02:54, 1 March 2026
- ...ought. If it is not equal, then depending on the comparison, the remaining search space is reduced to the part before or after the estimated position. This m |class=[[Search algorithm]] ...14 KB (2,057 words) - 00:25, 13 January 2026
- ...cs, Weizmann Institute of Science }}</ref> notes that: <blockquote>[Greedy algorithms] may be viewed as the ultimate form of dynamic programming, in which only o Many classic algorithms in computer science such as the [[Huffman coding|Huffman coding algorithm]] ...17 KB (2,389 words) - 03:31, 11 May 2026
- ...ficantly slow some search algorithms. One of many possible solutions is to search for the sequence of code units instead, but doing so may produce false matc ...ore occurrences of the needle within the haystack. For example, one might search for ''to'' within: ...21 KB (2,990 words) - 14:30, 23 May 2026
- * [[Brute-force search]] [[Category:Parsing algorithms]] ...2 KB (329 words) - 13:04, 10 November 2025
- ...url=https://dl.acm.org/citation.cfm?id=349132|title = The double metaphone search algorithm|journal = C/C++ Users Journal|date = June 2000|volume = 18|issue ...nds that the search results include too many words that don't resemble the search term closely enough.<ref>{{cite web|url=http://aspell.net/metaphone/|title= ...12 KB (1,831 words) - 11:33, 3 March 2026
- In [[computer science]], '''brute-force search''' or '''exhaustive search''', also known as '''generate and test''', is a very general [[problem-solv ...rce Algorithms Explained|url=https://www.freecodecamp.org/news/brute-force-algorithms-explained/|access-date=2021-04-11|website=freeCodeCamp.org|language=en}}</r ...15 KB (2,248 words) - 22:09, 30 July 2025
- ...ritish style of ringing church bells according to a series of mathematical algorithms {{canned search|method}} ...2 KB (355 words) - 13:41, 23 January 2026