This HTML5 document contains 24 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n15https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Distributed_tree_search
rdfs:label
Distributed tree search
rdfs:comment
Distributed tree search (DTS) algorithm is a class of algorithms for searching values in an efficient and distributed manner. Their purpose is to iterate through a tree by working along multiple branches in parallel and merging the results of each branch into one common solution, in order to minimize time spent searching for a value in a tree-like data structure. The original paper was written in 1988 by Chris Ferguson and Richard E. Korf, from the University of California's Computer Science Department. They used multiple other chess AIs to develop this wider range algorithm.
dct:subject
dbc:Algorithms
dbo:wikiPageID
50546680
dbo:wikiPageRevisionID
1050742932
dbo:wikiPageWikiLink
dbr:SQL dbr:Tree_(data_structure) dbc:Algorithms dbr:Binary_search_tree dbr:Monte_Carlo_tree_search dbr:IP_address dbr:Tree_traversal dbr:Search_tree dbr:Parallel_computing
owl:sameAs
wikidata:Q25305399 yago-res:Distributed_tree_search n15:2NhMG
dbp:wikiPageUsesTemplate
dbt:Orphan dbt:Reflist
dbo:abstract
Distributed tree search (DTS) algorithm is a class of algorithms for searching values in an efficient and distributed manner. Their purpose is to iterate through a tree by working along multiple branches in parallel and merging the results of each branch into one common solution, in order to minimize time spent searching for a value in a tree-like data structure. The original paper was written in 1988 by Chris Ferguson and Richard E. Korf, from the University of California's Computer Science Department. They used multiple other chess AIs to develop this wider range algorithm.
prov:wasDerivedFrom
wikipedia-en:Distributed_tree_search?oldid=1050742932&ns=0
dbo:wikiPageLength
7242
foaf:isPrimaryTopicOf
wikipedia-en:Distributed_tree_search
Subject Item
wikipedia-en:Distributed_tree_search
foaf:primaryTopic
dbr:Distributed_tree_search