Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Ternary_search> ?p ?o }
Showing triples 1 to 40 of
40
with 100 triples per page.
- Ternary_search abstract "A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function. A ternary search determines either that the minimum or maximum cannot be in the first third of the domain or that it cannot be in the last third of the domain, then repeats on the remaining two-thirds. A ternary search is an example of a divide and conquer algorithm (see search algorithm).".
- Ternary_search wikiPageID "4032583".
- Ternary_search wikiPageLength "3878".
- Ternary_search wikiPageOutDegree "14".
- Ternary_search wikiPageRevisionID "693523393".
- Ternary_search wikiPageWikiLink Binary_search_algorithm.
- Ternary_search wikiPageWikiLink Category:Mathematical_optimization.
- Ternary_search wikiPageWikiLink Category:Search_algorithms.
- Ternary_search wikiPageWikiLink Computer_science.
- Ternary_search wikiPageWikiLink Divide_and_conquer_algorithms.
- Ternary_search wikiPageWikiLink Exponential_search.
- Ternary_search wikiPageWikiLink Golden_section_search.
- Ternary_search wikiPageWikiLink Interpolation_search.
- Ternary_search wikiPageWikiLink Linear_search.
- Ternary_search wikiPageWikiLink Maxima_and_minima.
- Ternary_search wikiPageWikiLink Newtons_method_in_optimization.
- Ternary_search wikiPageWikiLink Search_algorithm.
- Ternary_search wikiPageWikiLink Unimodality.
- Ternary_search wikiPageWikiLinkText "Ternary search".
- Ternary_search wikiPageWikiLinkText "ternary search".
- Ternary_search wikiPageUsesTemplate Template:Math.
- Ternary_search wikiPageUsesTemplate Template:Unreferenced.
- Ternary_search subject Category:Mathematical_optimization.
- Ternary_search subject Category:Search_algorithms.
- Ternary_search hypernym Technique.
- Ternary_search type Area.
- Ternary_search type TopicalConcept.
- Ternary_search type Algorithm.
- Ternary_search type Area.
- Ternary_search type Redirect.
- Ternary_search comment "A ternary search algorithm is a technique in computer science for finding the minimum or maximum of a unimodal function. A ternary search determines either that the minimum or maximum cannot be in the first third of the domain or that it cannot be in the last third of the domain, then repeats on the remaining two-thirds. A ternary search is an example of a divide and conquer algorithm (see search algorithm).".
- Ternary_search label "Ternary search".
- Ternary_search sameAs Q2010006.
- Ternary_search sameAs جستجو_سهتایی.
- Ternary_search sameAs m.0bdh_v.
- Ternary_search sameAs Троичный_поиск.
- Ternary_search sameAs การค้นหาแบบไตรภาค.
- Ternary_search sameAs Q2010006.
- Ternary_search wasDerivedFrom Ternary_search?oldid=693523393.
- Ternary_search isPrimaryTopicOf Ternary_search.