NTriples DBPedia from Musatov thank me later

[Martin Musatov]

<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2002/07/owl#sameAs> <http://de.dbpedia.org/resource/Suchverfahren> .
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2002/07/owl#sameAs> <http://de.dbpedia.org/resource/Suchverfahren>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "Die Informatik bezeichnet mit
Suchverfahren oder Suchalgorithmus einen Algorithmus, der in einem
Suchraum nach Mustern oder Objekten mit bestimmten Eigenschaften
sucht. Man unterscheidet einfache und heuristische Suchalgorithmen.
Einfache Suchalgorithmen benutzen intuitive Methoden f\u00FCr das
Durchsuchen des Suchraumes, w\u00E4hrend heuristische Suchalgorithmen
Wissen \u00FCber den Suchraum (beispielsweise die Datenverteilung) mit
einbeziehen, um die ben\u00F6tigte Suchzeit zu reduzieren."@de .
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "Die Informatik bezeichnet Suchverfahren
oder mit einen Suchalgorithmus Algorithmus, in einem der nach Suchraum
Muster oder mit object's bestimmte Eigenschaften sucht. unterscheidet
Man einfache und heuristische Suchalgorithmen. Einfache
Suchalgorithmen benutzen intuitive Methoden f \ u00FCr das Durchsuchen
des Suchraumes, w \ u00E4hrend heuristische Suchalgorithmen Wissen \
u00FCber the Suchraum (beispielsweise die Datenverteilung) mit
einbeziehen, um die ben \ u00F6tigte Suchzeit zu reduzieren. "@ de.
<http://dbpedia.org/resource/Search_algorithm> <http://xmlns.com/foaf/
0.1/isPrimaryTopicOf> <http://en.wikipedia.org/wiki/
Search_algorithm> . <http://dbpedia.org/resource/Search_algorithm>
<http://xmlns.com/foaf/0.1/isPrimaryTopicOf> <http://en.wikipedia.org/
wiki/Search_algorithm>.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> "En informatique, un algorithme de recherche est un
type d'algorithme qui, pour un domaine, un probl\u00E8me de ce domaine
et des crit\u00E8res donn\u00E9s, retourne en r\u00E9sultat un
ensemble de solutions r\u00E9pondant au probl\u00E8me. Supposons que
l'ensemble de ses entr\u00E9es soit divisible en sous-ensemble, par
rapport \u00E0 un crit\u00E8re donn\u00E9, qui peut \u00EAtre, par
exemple, une relation d'ordre. De fa\u00E7on g\u00E9n\u00E9rale, un
tel algorithme v\u00E9rifie un certain nombre de ces entr\u00E9es et
retourne en sortie une ou plusieurs des entr\u00E9es vis\u00E9es.
L'ensemble de toutes les solutions potentielles dans le domaine est
appel\u00E9 espace de recherche."@fr . <http://dbpedia.org/resource/
Search_algorithm> <http://dbpedia.org/ontology/abstract> "I
informatique, de recherche un Algorithm est un type d'Algorithm qui,
pour un domaine, un Probl \ u00E8me de ce domaine et des crit \
u00E8res Donn \ u00E9s, retourne en r \ u00E9sultat un ensemble de
solutions r \ u00E9pondant au Probl \ u00E8me. Supposons que
l'ensemble de ses entr \ u00E9es ringing Divisible en sous-ensemble,
par rapport \ u00E0 un crit \ u00E8re Donn \ u00E9, qui peut \
u00EAtre, par Exempla, une relation d'ordre. De fa \ u00E7on g \
u00E9n \ u00E9rale, un tel Algorithm v \ u00E9rifie Un Certain nombre
de ces entr \ u00E9es you retourne en sortie une ou plusieurs des entr
\ u00E9es vis \ u00E9es. L'ensemble de toutes les solutions
potentielles dans le domaine est orange \ u00E9 espace de recherche.
"@ fr.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "Un algoritmo di ricerca \u00E8 un
algoritmo che permette di trovare un elemento avente determinate
caratteristiche all'interno di un insieme di elementi."@it . <http://
dbpedia.org/resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#comment> "Un di ricerca algoritmo \ u00E8 un algoritmo Permet
che di un trovare Elemento avente determinate caratteristiche
all'interno di un insieme di elements. "@ it.
<http://dbpedia.org/resource/Search_algorithm> <http://purl.org/dc/
terms/subject> <http://dbpedia.org/resource/
Category:Search_algorithms> . <http://dbpedia.org/resource/
Search_algorithm> <http://purl.org/dc/terms/subject> <http://
dbpedia.org/resource/Category:Search_algorithms>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "\u63A2\u7D22"@ja . <http://dbpedia.org/
resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#label> "\ u63A2 \ u7D22" @ and.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> "Hakualgoritmilla voidaan tarkoittaa mit\u00E4
tahansa algoritmia, jolle kerrotaan ongelma ja joka etsii siihen
vastauksen. Yleens\u00E4 merkitys on suppeampi, ja haulla tarkoitetaan
arvon etsimist\u00E4 tietorakenteesta. T\u00E4llaiset hakualgoritmit
ovat keskeisi\u00E4 ohjelmoinnissa ja tietojenk\u00E4sittelytieteess
\u00E4, ja niit\u00E4 on hyvinkin monenlaisia k\u00E4ytett\u00E4v
\u00E4st\u00E4 tietorakenteesta riippuen. Yksinkertaisin ja yleisk
\u00E4ytt\u00F6isin hakualgoritmi on per\u00E4kk\u00E4ishaku, joka
etsii etsii arvoa s\u00E4ili\u00F6st\u00E4 k\u00E4ym\u00E4ll\u00E4 per
\u00E4kk\u00E4in l\u00E4pi jokaisen alkion. Se toimii jokaisessa
tietorakenteessa, joka sallii alkioiden l\u00E4pik\u00E4ynnin ja yht
\u00E4suuruusvertailun. Tyypillisesti sit\u00E4 k\u00E4ytet
\u00E4\u00E4n j\u00E4rjest\u00E4m\u00E4tt\u00F6miin taulukoihin ja
linkitettyihin listoihin. Jos tietorakenteen alkioista tiedet
\u00E4\u00E4n jotakin erityist\u00E4, algoritmi voi k\u00E4ytt
\u00E4\u00E4 t\u00E4t\u00E4 tietoa hyv\u00E4kseen. Suuruusj
\u00E4rjestyksess\u00E4 olevaan taulukkoon puree puolitushaku eli bin
\u00E4\u00E4rihaku. Jos alkiot ovat viel\u00E4 jakautuneet jokseenkin s
\u00E4\u00E4nn\u00F6llisesti, interpolaatiohaku voi nopeuttaa hakua
entisest\u00E4\u00E4n. Puun l\u00E4pik\u00E4yntialgoritmit liittyv
\u00E4t kiinte\u00E4sti kyseisiin tietorakenteisiin. Alkeellisin
esimerkki on bin\u00E4\u00E4rihakupuu, jossa jokaisessa solmussa on
kaksi alipuuta: vasemmassa on vain solmua pienempi\u00E4 alkioita ja
oikeassa solmua suurempia alkioita. T\u00E4m\u00E4 mahdollistaa nopean
hakualgoritmin, jos puu on tasapainoinen. Bin\u00E4\u00E4rihakupuu
Punamusta puu AVL-puu B-puu Graafin eli verkon l\u00E4pik
\u00E4yntialgoritmit etsiv\u00E4t arvon lis\u00E4ksi lyhimm\u00E4n
polun l\u00E4ht\u00F6solmun ja etsitt\u00E4v\u00E4\u00E4n solmun v
\u00E4lille. Ne ovat siis samalla polunhakualgoritmeja. Koska puutkin
ovat verkkoja, niiden l\u00E4pik\u00E4yntialgoritmeissa on paljon
yhteist\u00E4. Syvyyssuuntainen l\u00E4pik\u00E4ynti eli syvyysetsint
\u00E4 (engl. depth-first search, DFS) Leveyssuuntainen l\u00E4pik
\u00E4ynti eli leveysetsint\u00E4 (engl. breadth-first search,
BFS)"@fi . <http://dbpedia.org/resource/Search_algorithm> <http://
dbpedia.org/ontology/abstract> "search algorithms can mean measurement
\ u00E4 any algorithm which describes the problem and that searches
for an answer. Usually the \ u00E4 importance is more limited, and for
purposes of value etsimist \ u00E4 data structure. T \ u00E4llaiset
search algorithms are the most essential \ u00E4 programming and of
Computer \ u00E4sittelytieteess \ u00E4, their meadow \ u00E4 is a
very wide range of k \ u00E4ytett \ u00E4v \ u00E4st \ u00E4 data
structure. simplest and most general purpose \ u00E4ytt \ u00F6isin
search algorithm on a per \ u00E4kk \ u00E4ishaku who is looking for
looking for the value of s \ u00E4ili \ u00F6st \ u00E4 k \ u00E4ym \
u00E4ll \ u00E4 Fri \ u00E4kk \ u00E4in l \ u00E4pi each element., it
works with any data structure, which allows the embryos l \ u00E4pik \
u00E4ynnin and total \ u00E4suuruusvertailun. Typically, sit \ u00E4 k
\ u00E4ytet \ u00E4 \ u00E4n j \ u00E4rjest \ u00E4m \ u00E4tt \
u00F6miin tables and linked lists., if the data structure of germs are
known \ u00E4 \ u00E4n one of the special \ u00E4, the algorithm can k
\ u00E4ytt \ u00E4 \ u00E4 t \ u00E4t \ u00E4 about the good \
u00E4kseen. Suuruusj \ u00E4rjestyksess \ u00E4 to the table biting
proofreader or bin \ u00E4 \ u00E4rihaku., if the elements are viel \
u00E4 distributed more or less s \ u00E4 \ u00E4nn \ u00F6llisesti,
interpolaatiohaku can speed up search entisest \ u00E4 \ u00E4n.
timber l \ u00E4pik \ u00E4yntialgoritmit involved \ u00E4t fixed \
u00E4sti these data structures., even the simplest example is the bin
\ u00E4 \ u00E4rihakupuu, where each node has two trees: the left is
just a node smaller \ u00E4 embryos and right nodes larger embryos. T
\ u00E4m \ u00E4 enables fast search algorithm, if the tree is
balanced. Bin \ u00E4 \ u00E4rihakupuu red-black tree AVL tree B-tree
graph of the network l \ u00E4pik \ u00E4yntialgoritmit etsiv \ u00E4t
value lis \ u00E4ksi shortest \ u00E4n path l \ u00E4ht \ u00F6solmun
and etsitt \ u00E4v \ u00E4 \ u00E4n node v \ u00E4lille. They are
therefore in the same path search algorithms. Since very trees are
networks of l \ u00E4pik \ u00E4yntialgoritmeissa is much in common
with \ u00E4. depth The l \ u00E4pik \ u00E4ynti of syvyysetsint \
u00E4 ( in english. depth-first search, DFS) Width way l \ u00E4pik \
u00E4ynti ie leveysetsint \ u00E4 (in english breadth-first search,
BFS) "@ en.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2002/07/owl#sameAs> <http://rdf.freebase.com/ns/m.06_xd> . <http://
dbpedia.org/resource/Search_algorithm> <http://www.w3.org/2002/07/
owl#sameAs> <http://rdf.freebase.com/ns/m.06_xd>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "Trong ng\u00E0nh khoa h\u1ECDc m\u00E1y t
\u00EDnh, m\u1ED9t gi\u1EA3i thu\u1EADt t\u00ECm ki\u1EBFm l\u00E0 m
\u1ED9t thu\u1EADt to\u00E1n l\u1EA5y \u0111\u1EA7u v\u00E0o l\u00E0 m
\u1ED9t b\u00E0i to\u00E1n v\u00E0 tr\u1EA3 v\u1EC1 k\u1EBFt qu\u1EA3 l
\u00E0 m\u1ED9t l\u1EDDi gi\u1EA3i cho b\u00E0i to\u00E1n
\u0111\u00F3, th\u01B0\u1EDDng l\u00E0 sau khi c\u00E2n nh\u1EAFc gi
\u1EEFa m\u1ED9t lo\u1EA1t c\u00E1c l\u1EDDi gi\u1EA3i c\u00F3 th
\u1EC3. H\u1EA7u h\u1EBFt c\u00E1c thu\u1EADt to\u00E1n
\u0111\u01B0\u1EE3c nghi\u00EAn c\u1EE9u b\u1EDFi c\u00E1c nh\u00E0
khoa h\u1ECDc m\u00E1y t\u00EDnh \u0111\u1EC3 gi\u1EA3i quy\u1EBFt c
\u00E1c b\u00E0i to\u00E1n \u0111\u1EC1u l\u00E0 c\u00E1c thu\u1EADt to
\u00E1n t\u00ECm ki\u1EBFm. T\u1EADp h\u1EE3p t\u1EA5t c\u1EA3 c
\u00E1c l\u1EDDi gi\u1EA3i c\u00F3 th\u1EC3 \u0111\u1ED1i v\u1EDBi m
\u1ED9t b\u00E0i to\u00E1n \u0111\u01B0\u1EE3c g\u1ECDi l\u00E0 kh
\u00F4ng gian t\u00ECm ki\u1EBFm."@vi . <http://dbpedia.org/resource/
Search_algorithm> <http://www.w3.org/2000/01/rdf-schema#comment>
"Trong ng \ u00E0nh Khoa h \ u1ECDc m \ u00E1y t \ u00EDnh, m \ u1ED9t
gi \ u1EA3i thu \ u1EADt t \ u00ECm ki \ u1EBFm l \ u00E0 m \ u1ED9t
thu \ u1EADt to \ u00E1n l \ u1EA5y \ u0111 \ u1EA7u v \ u00E0o l \
u00E0 m \ u1ED9t b \ u00E0i to \ v u00E1n \ u00E0 tr \ u1EA3 v \ u1EC1
k \ u1EBFt qu \ u1EA3 l \ u00E0 m \ u1ED9t l \ u1EDDi gi \ u1EA3i cho
b \ u00E0i to \ u00E1n \ u0111 \ u00F3, th \ u01B0 \ u1EDDng l \ u00E0
chi sau c \ u00E2n nh \ u1EAFc gi \ u1EEFa m \ u1ED9t lo \ u1EA1t c \
u00E1c l \ u1EDDi gi \ u1EA3i c \ u00F3 th \ u1EC3. H \ u1EA7u h \
u1EBFt c \ u00E1c thu \ u1EADt to \ u00E1n \ u0111 \ u01B0 \ u1EE3c
Nghi \ u00EAn c \ u1EE9u b \ c u1EDFi \ u00E1c nh \ u00E0 Khoa h \
u1ECDc m \ u00E1y t \ u00EDnh \ u0111 \ u1EC3 gi \ u1EA3i Quy \ u1EBFt
c \ u00E1c b \ u00E0i to \ u00E1n \ u0111 \ u1EC1u l \ u00E0 c \
u00E1c thu \ u1EADt to \ u00E1n t \ u00ECm ki \ u1EBFm. T \ u1EADp h \
u1EE3p t \ u1EA5t c \ u1EA3 c \ u00E1c l \ u1EDDi gi \ u1EA3i c \
u00F3 th \ u1EC3 \ u0111 \ u1ED1i v \ u1EDBi m \ u1ED9t b \ u00E0i to
\ u00E1n \ u0111 \ u01B0 \ u1EE3c g \ u1ECDi l \ u00E0 kh \ u00F4ng
energy t \ u00ECm ki \ u1EBFm. "@ vi.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "In computer science, a search algorithm
is an algorithm for finding an item with specified properties among a
collection of items. The items may be stored individually as records
in a database; or may be elements of a search space defined by a
mathematical formula or procedure, such as the roots of an equation
with integer variables; or a combination of the two, such as the
Hamiltonian circuits of a graph."@en . <http://dbpedia.org/resource/
Search_algorithm> <http://www.w3.org/2000/01/rdf-schema#comment> "In
computer science, a search algorithm is an algorithm for finding an
item with Specified properties among a collection of items. The items
may be Stored individually as records in a database, or may be
elements of a search space defined by a mathematical formula or
procedure, such as the roots of an equation with integer variables, or
a combination of the two, such as the Hamiltonian circuits of a graph.
"@ en.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
1999/02/22-rdf-syntax-ns#type> <http://dbpedia.org/class/yago/
SearchAlgorithms> . <http://dbpedia.org/resource/Search_algorithm>
<http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://dbpedia.org/
class/yago / SearchAlgorithms>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "Search algorithm"@en . <http://dbpedia.org/
resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#label> "search algorithm" @ en.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> "Die Informatik bezeichnet mit Suchverfahren oder
Suchalgorithmus einen Algorithmus, der in einem Suchraum nach Mustern
oder Objekten mit bestimmten Eigenschaften sucht. Man unterscheidet
einfache und heuristische Suchalgorithmen. Einfache Suchalgorithmen
benutzen intuitive Methoden f\u00FCr das Durchsuchen des Suchraumes, w
\u00E4hrend heuristische Suchalgorithmen Wissen \u00FCber den Suchraum
(beispielsweise die Datenverteilung) mit einbeziehen, um die ben
\u00F6tigte Suchzeit zu reduzieren. Die L\u00F6sung eines
algorithmischen Problems kann allgemein als Suche nach der L\u00F6sung
in einer Menge von m\u00F6glichen L\u00F6sungen verstanden werden. Als
L\u00F6sung kann der Zielzustand gelten, aber auch der Pfad zum Ziel
oder die Reihenfolge im Vorgehen. Ist der Suchraum endlich, kann die
Suche mit einer geeigneten Suchstrategie immer zu einem Ergebnis f
\u00FChren. Bei unendlichen (L\u00F6sungs-)Mengen muss die Suche nach
gewissen Kriterien (z. \u00A0B. nach einer bestimmten Zeit)
abgebrochen werden. Wiederholte Suche in einer endlichen Menge kann
dadurch effizient gestaltet werden, dass \u00FCber den Daten eine
Indexstruktur (z. \u00A0B. in Form eines Suchbaums) erstellt wird, der
nach einem bestimmten Kriterium sortiert ist. Dann m\u00FCssen bei
einer Suche nicht mehr alle Eintr\u00E4ge betrachtet werden (z.
\u00A0B. beginnt man die Suche in einem Telefonbuch bei dem
Buchstaben, mit dem der Name anf\u00E4ngt)."@de . <http://dbpedia.org/
resource/Search_algorithm> <http://dbpedia.org/ontology/abstract> "Die
Informatik bezeichnet Suchverfahren oder mit einen Suchalgorithmus
Algorithmus, in einem der Suchraum nach Muster oder mit object's
bestimmte Eigenschaften sucht. Man unterscheidet einfache und
heuristische Suchalgorithmen. Einfache Suchalgorithmen benutzen
intuitive Methoden f \ u00FCr das Durchsuchen des Suchraumes, w \
u00E4hrend heuristische Suchalgorithmen Wissen \ u00FCber the Suchraum
(beispielsweise die Datenverteilung) mit einbeziehen, um die ben \
u00F6tigte Suchzeit zu reduzieren. Die L \ u00F6sung eines
algorithmischen Problems allgemein kann als der Suche nach L \
u00F6sung in einer von Menge m \ u00F6glichen L \ u00F6sungen Verstand
werden. Als L \ u00F6sung kann der Zielzustand gelten, aber auch zum
Ziel der Pfad oder die im Reihenfolge Vorgehen. Ist der Suchraum
endlich, kann die mit einer Suche geeigneten Suchstrategie immer zu
einem Ergebnisse f \ u00FChren. Bei unendlichen (L \ u00F6sungs-)
Mengen muss die Suche nach gewissen Kriterien (z. \ u00A0B. nach einer
Zeit bestimmte) abgebrochen werden. Wiederholt in einer Suche
endlichen Menge kann dadurch effizient gestaltet werden, dass \ Daten
u00FCber the eine Indexstruktur (z. \ u00A0B. Suchbaums in Form eines)
erstellt wird, der nach einem bestimmte Kriterium sortiert ist. Dann m
\ u00FCssen bei einer Suche nicht mehr less than EINTR \ u00E4ge
betrachtet werden (z. \ u00A0B. beginnt man die Suche in einem
Telefonbuch bei dem Buchstaben, mit dem der Name anf \ u00E4ngt). "@
de.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> "Trong ng\u00E0nh khoa h\u1ECDc m\u00E1y t\u00EDnh,
m\u1ED9t gi\u1EA3i thu\u1EADt t\u00ECm ki\u1EBFm l\u00E0 m\u1ED9t thu
\u1EADt to\u00E1n l\u1EA5y \u0111\u1EA7u v\u00E0o l\u00E0 m\u1ED9t b
\u00E0i to\u00E1n v\u00E0 tr\u1EA3 v\u1EC1 k\u1EBFt qu\u1EA3 l\u00E0 m
\u1ED9t l\u1EDDi gi\u1EA3i cho b\u00E0i to\u00E1n \u0111\u00F3, th
\u01B0\u1EDDng l\u00E0 sau khi c\u00E2n nh\u1EAFc gi\u1EEFa m\u1ED9t lo
\u1EA1t c\u00E1c l\u1EDDi gi\u1EA3i c\u00F3 th\u1EC3. H\u1EA7u h
\u1EBFt c\u00E1c thu\u1EADt to\u00E1n \u0111\u01B0\u1EE3c nghi\u00EAn c
\u1EE9u b\u1EDFi c\u00E1c nh\u00E0 khoa h\u1ECDc m\u00E1y t\u00EDnh
\u0111\u1EC3 gi\u1EA3i quy\u1EBFt c\u00E1c b\u00E0i to\u00E1n
\u0111\u1EC1u l\u00E0 c\u00E1c thu\u1EADt to\u00E1n t\u00ECm ki
\u1EBFm. T\u1EADp h\u1EE3p t\u1EA5t c\u1EA3 c\u00E1c l\u1EDDi gi
\u1EA3i c\u00F3 th\u1EC3 \u0111\u1ED1i v\u1EDBi m\u1ED9t b\u00E0i to
\u00E1n \u0111\u01B0\u1EE3c g\u1ECDi l\u00E0 kh\u00F4ng gian t\u00ECm
ki\u1EBFm. T\u00ECm ki\u1EBFm b\u1EB1ng v\u00E9t c\u1EA1n (brute-force
search) hay c\u00E1c thu\u1EADt to\u00E1n t\u00ECm ki\u1EBFm \"s\u01A1
\u0111\u1EB3ng\"/kh\u00F4ng c\u00F3 th\u00F4ng tin s\u1EED d\u1EE5ng ph
\u01B0\u01A1ng ph\u00E1p \u0111\u01A1n gi\u1EA3n nh\u1EA5t v\u00E0 tr
\u1EF1c quan nh\u1EA5t. Trong khi \u0111\u00F3, c\u00E1c thu\u1EADt to
\u00E1n t\u00ECm ki\u1EBFm c\u00F3 th\u00F4ng tin s\u1EED d\u1EE5ng
heuristics \u0111\u1EC3 \u00E1p d\u1EE5ng c\u00E1c tri th\u1EE9c v
\u1EC1 c\u1EA5u tr\u00FAc c\u1EE7a kh\u00F4ng gian t\u00ECm ki\u1EBFm
nh\u1EB1m gi\u1EA3m th\u1EDDi gian c\u1EA7n thi\u1EBFt cho vi\u1EC7c t
\u00ECm ki\u1EBFm."@vi . <http://dbpedia.org/resource/
Search_algorithm> <http://dbpedia.org/ontology/abstract> "Trong ng \
u00E0nh Khoa h \ u1ECDc m \ u00E1y t \ u00EDnh, m \ u1ED9t gi \ u1EA3i
thu \ u1EADt t \ u00ECm ki \ u1EBFm l \ u00E0 m \ u1ED9t thu \ u1EADt
to \ u00E1n l \ u1EA5y \ u0111 \ u1EA7u v \ u00E0o l \ u00E0 m \
u1ED9t b \ u00E0i to \ u00E1n v \ u00E0 tr \ u1EA3 v \ u1EC1 k \
u1EBFt qu \ u1EA3 l \ u00E0 m \ u1ED9t l \ u1EDDi gi \ u1EA3i cho b \
u00E0i to \ u00E1n \ u0111 \ u00F3, th \ u01B0 \ u1EDDng l \ u00E0 chi
sau c \ u00E2n nh \ u1EAFc gi \ m u1EEFa \ u1ED9t lo \ u1EA1t c \
u00E1c l \ u1EDDi gi \ u1EA3i c \ u00F3 th \ u1EC3. H \ u1EA7u h \
u1EBFt c \ u00E1c thu \ u1EADt to \ u00E1n \ u0111 \ u01B0 \ u1EE3c
Nghi \ u00EAn c \ u1EE9u b \ u1EDFi c \ u00E1c nh \ u00E0 Khoa h \
u1ECDc m \ u00E1y t \ u00EDnh \ u0111 \ u1EC3 gi \ u1EA3i Quy \ u1EBFt
c \ u00E1c b \ u00E0i to \ u00E1n \ u0111 \ u1EC1u l \ u00E0 c \
u00E1c thu \ u1EADt Thurs \ u00E1n t \ u00ECm ki \ u1EBFm. T \ u1EADp
h \ u1EE3p t \ u1EA5t c \ u1EA3 c \ u00E1c l \ u1EDDi gi \ u1EA3i c \
u00F3 th \ u1EC3 \ u0111 \ u1ED1i v \ u1EDBi m \ u1ED9t b \ u00E0i
Thurs \ u00E1n \ u0111 \ u01B0 \ u1EE3c g \ u1ECDi l \ u00E0 kh \
u00F4ng energy t \ u00ECm ki \ u1EBFm. T \ u00ECm ki \ u1EBFm b \
u1EB1ng v \ u00E9t c \ u1EA1n (brute-force search) hay c \ u00E1c thu
\ u1EADt to \ u00E1n t \ u00ECm ki \ u1EBFm \ 's \ u01A1 \ u0111 \
u1EB3ng \ "/ kh \ u00F4ng c \ u00F3 th \ u00F4ng tin s \ u1EED d \
u1EE5ng ph \ u01B0 \ u01A1ng ph \ u00E1p \ u0111 \ u01A1n gi \ u1EA3n
nh \ u1EA5t v \ u00E0 tr \ u1EF1c quan nh \ u1EA5t. Trong chi \ u0111
\ u00F3, c \ u00E1c thu \ u1EADt to \ u00E1n t \ u00ECm ki \ u1EBFm c
\ u00F3 th \ u00F4ng tin s \ u1EED d \ u1EE5ng heuristics \ u0111 \
u1EC3 \ u00E1p d \ u1EE5ng c \ u00E1c tri th \ u1EE9c v \ u1EC1 c \
u1EA5u tr \ u00FAc c \ u1EE7a kh \ u00F4ng energy t \ u00ECm ki \
u1EBFm nh \ u1EB1m gi \ u1EA3m th \ u1EDDi energy c \ u1EA7n thi \
u1EBFt cho vi \ u1EC7c t \ u00ECm ki \ u1EBFm. "@ vi.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> "Em ci\u00EAncia da computa\u00E7\u00E3o, um
algoritmo de busca, em termos gerais, \u00E9 um algoritmo que toma um
problema como entrada e retorna a solu\u00E7\u00E3o para o problema,
geralmente ap\u00F3s resolver um n\u00FAmero poss\u00EDvel de solu
\u00E7\u00F5es. A maioria dos algoritmos estudados por cientistas da
computa\u00E7\u00E3o que resolvem problemas s\u00E3o algortimos de
busca. O conjunto de todas as solu\u00E7\u00F5es poss\u00EDveis para
um problema \u00E9 chamado de espa\u00E7o de busca."@pt . <http://
dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/ontology/
abstract> 'Em ci \ u00EAncia da computa \ u00E7 \ u00E3o, um algoritmo
busca de, em thermos gerais, \ u00E9 um algoritmo que toma como um
problema entrada e retorna a cell \ u00E7 \ u00E3o para o problema,
geralmente ap \ u00F3s resolver um n \ u00FAmero poss \ u00EDvel cell
de \ u00E7 \ u00F5es. maioria A dos por algoritmos estudados
cientistas da computa \ u00E7 \ u00E3o resolvem problemas que s \
u00E3o algortimos de busca. O conjunto de todas as cell \ u00E7 \
u00F5es poss \ u00EDveis para um problema \ u00E9 chamado de espa \
u00E7o busca de. "@ pt.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "Hakualgoritmilla voidaan tarkoittaa mit
\u00E4 tahansa algoritmia, jolle kerrotaan ongelma ja joka etsii
siihen vastauksen. Yleens\u00E4 merkitys on suppeampi, ja haulla
tarkoitetaan arvon etsimist\u00E4 tietorakenteesta. T\u00E4llaiset
hakualgoritmit ovat keskeisi\u00E4 ohjelmoinnissa ja tietojenk
\u00E4sittelytieteess\u00E4, ja niit\u00E4 on hyvinkin monenlaisia k
\u00E4ytett\u00E4v\u00E4st\u00E4 tietorakenteesta riippuen."@fi .
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "search algorithms can mean measurement \
u00E4 any algorithm which describes the problem and finds that answer
to that question. Usually the \ u00E4 role is more limited, and for
purposes of value etsimist \ u00E4 data structure. T \ u00E4llaiset
search algorithms are the most essential \ u00E4 programming and of
Computer \ u00E4sittelytieteess \ u00E4, their meadow \ u00E4 is a
very wide range of k \ u00E4ytett \ u00E4v \ u00E4st \ u00E4 data
structure. "@ en.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> "Un algoritmo de b\u00FAsqueda es aquel que est
\u00E1 dise\u00F1ado para localizar un elemento con ciertas
propiedades dentro de una estructura de datos; por ejemplo, ubicar el
registro correspondiente a cierta persona en una base de datos, o el
mejor movimiento en una partida de ajedrez. La variante m\u00E1s
simple del problema es la b\u00FAsqueda de un n\u00FAmero en un
vector."@es . <http://dbpedia.org/resource/Search_algorithm> <http://
dbpedia.org/ontology/abstract> "Un algoritmo de b \ u00FAsqueda aquel
es que est \ u00E1 dise \ u00F1ado para un localizar Elemento con
ciertas Propiedades dentro de una estructura de Datos, por ejemplo, el
Registro ubicar correspondiente a cierta persona en una base de Datos,
o el mejor movimiento en una partida de Ajedrez. La Variante m \
u00E1s simple del problema es la b \ u00FAsqueda de un n \ u00FAmero
en un vector. "@ es.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> "Un algoritmo di ricerca \u00E8 un algoritmo che
permette di trovare un elemento avente determinate caratteristiche
all'interno di un insieme di elementi."@it . <http://dbpedia.org/
resource/Search_algorithm> <http://dbpedia.org/ontology/abstract> "Un
di ricerca algoritmo \ u00E8 un algoritmo Permet che di un trovare
Elemento avente determinate caratteristiche all'interno di un insieme
di elements. "@ it.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "In de informatica is een zoekalgoritme
een algoritme dat in brongegevens zoekt naar bepaalde objecten. De
verzameling gegevens waarin men zoekt wordt de zoekruimte genoemd.
Eenvoudige zoekalgoritmen gebruiken algemene intu\u00EFtieve methoden
om een oplossing te vinden, heuristische zoekalgortimen gebruiken een
voorkennis omtrent de zoekruimte om sneller tot een resultaat te
komen."@nl . <http://dbpedia.org/resource/Search_algorithm> <http://
www.w3.org/2000/01/rdf-schema#comment> "In de informatica is noon
zoekalgoritme C. algorithms dat in brongegevens zoekt naar bepaalde
Object . verzameling De gegevens waarin men zoekt wordt de zoekruimte
genoemd. eenvoudig zoekalgoritmen gebruiken algemene INTU \ u00EFtieve
Methoden C. oplossing om te vinden, heuristische zoekalgortimen
gebruiken C. voorkennis omtrent zoekruimte om de tot C. Sneller result
you command. "@ nl.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "Algoritmo di ricerca"@it . <http://
dbpedia.org/resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#label> "Algoritmo di ricerca" @ it.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2002/07/owl#sameAs> <http://fr.dbpedia.org/resource/
Algorithme_de_recherche> . <http://dbpedia.org/resource/
Search_algorithm> <http://www.w3.org/2002/07/owl#sameAs> <http://
fr.dbpedia.org/resource/Algorithme_de_recherche>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2002/07/owl#sameAs> <http://it.dbpedia.org/resource/
Algoritmo_di_ricerca> . <http://dbpedia.org/resource/Search_algorithm>
<http://www.w3.org/2002/07/owl#sameAs> <http://it.dbpedia.org/resource/
Algoritmo_di_ricerca>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2002/07/owl#sameAs> <http://ja.dbpedia.org/resource/\u63A2\u7D22> .
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2002/07/owl#sameAs> <http://ja.dbpedia.org/resource/\u63A2\u7D22> .
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2002/07/owl#sameAs> <http://pt.dbpedia.org/resource/
Algoritmo_de_busca> . <http://dbpedia.org/resource/Search_algorithm>
<http://www.w3.org/2002/07/owl#sameAs> <http://pt.dbpedia.org/resource/
Algoritmo_de_busca>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "Suchverfahren"@de . <http://dbpedia.org/
resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#label> "Suchverfahren" @ de.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "Gi\u1EA3i thu\u1EADt t\u00ECm ki
\u1EBFm"@vi . <http://dbpedia.org/resource/Search_algorithm> <http://
www.w3.org/2000/01/rdf-schema#label> "Gi \ u1EA3i thu \ u1EADt t \
u00ECm k \ u1EBFm" @ vi .
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "Algorithme de recherche"@fr . <http://
dbpedia.org/resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#label> "algorithm de recherche" @ fr.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2002/07/owl#sameAs> <http://es.dbpedia.org/resource/Algoritmo_de_b
\u00FAsqueda> . <http://dbpedia.org/resource/Search_algorithm> <http://
www.w3.org/2002/07/owl#sameAs> <http://es.dbpedia.org/resource/
Algoritmo_de_b\u00FAsqueda>.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> "In computer science, a search algorithm is an
algorithm for finding an item with specified properties among a
collection of items. The items may be stored individually as records
in a database; or may be elements of a search space defined by a
mathematical formula or procedure, such as the roots of an equation
with integer variables; or a combination of the two, such as the
Hamiltonian circuits of a graph."@en . <http://dbpedia.org/resource/
Search_algorithm> <http://dbpedia.org/ontology/abstract> "In computer
science, a search algorithm is an algorithm for finding an item with
Specified properties among a collection of items. The items may be
Stored individually as records in a database, or may be elements of a
search space defined by a mathematical formula or procedure, such as
the roots of an equation with integer variables, or a combination of
the two, such as the Hamiltonian circuits of a graph. "@ en.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> "In de informatica is een zoekalgoritme een
algoritme dat in brongegevens zoekt naar bepaalde objecten. De
verzameling gegevens waarin men zoekt wordt de zoekruimte genoemd.
Eenvoudige zoekalgoritmen gebruiken algemene intu\u00EFtieve methoden
om een oplossing te vinden, heuristische zoekalgortimen gebruiken een
voorkennis omtrent de zoekruimte om sneller tot een resultaat te
komen."@nl . <http://dbpedia.org/resource/Search_algorithm> <http://
dbpedia.org/ontology/abstract> "In de informatica is noon
zoekalgoritme C. algorithms dat in brongegevens zoekt naar bepaalde
Object. verzameling De gegevens waarin men zoekt wordt de zoekruimte
genoemd. eenvoudig zoekalgoritmen gebruiken algemene INTU \ u00EFtieve
Methoden C. oplossing om te vinden, heuristische zoekalgortimen
gebruiken C. voorkennis omtrent zoekruimte om de tot C. Sneller result
you command. "@ nl.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "En informatique, un algorithme de
recherche est un type d'algorithme qui, pour un domaine, un probl
\u00E8me de ce domaine et des crit\u00E8res donn\u00E9s, retourne en r
\u00E9sultat un ensemble de solutions r\u00E9pondant au probl\u00E8me.
Supposons que l'ensemble de ses entr\u00E9es soit divisible en sous-
ensemble, par rapport \u00E0 un crit\u00E8re donn\u00E9, qui peut
\u00EAtre, par exemple, une relation d'ordre."@fr . <http://
dbpedia.org/resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#comment> "I informatique, de recherche un Algorithm est un type
d'Algorithm qui, domaine pour un, un Probl \ u00E8me de ce domaine et
des crit \ u00E8res Donn \ u00E9s, retourne en r \ u00E9sultat un
ensemble de solutions r \ u00E9pondant au Probl \ u00E8me. Supposons
que l'ensemble de ses entr \ u00E9es ringing Divisible I sous-
ensemble, par rapport \ u00E0 un crit \ u00E8re Donn \ u00E9, qui peut
\ u00EAtre, par Exempla, une relation d'ordre. "@ fr.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "Algoritmo de b\u00FAsqueda"@es . <http://
dbpedia.org/resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#label> "Algoritmo de b \ u00FAsqueda" @ es.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/wikiPageExternalLink> <http://en.wikiversity.org/wiki/
Uninformed_Search_Project> . <http://dbpedia.org/resource/
Search_algorithm> <http://dbpedia.org/ontology/wikiPageExternalLink>
<http://en.wikiversity.org/wiki/Uninformed_Search_Project>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "Algoritmo de busca"@pt . <http://
dbpedia.org/resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#label> "Algoritmo de busca" @ pt.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "Em ci\u00EAncia da computa\u00E7\u00E3o,
um algoritmo de busca, em termos gerais, \u00E9 um algoritmo que toma
um problema como entrada e retorna a solu\u00E7\u00E3o para o
problema, geralmente ap\u00F3s resolver um n\u00FAmero poss\u00EDvel
de solu\u00E7\u00F5es. A maioria dos algoritmos estudados por
cientistas da computa\u00E7\u00E3o que resolvem problemas s\u00E3o
algortimos de busca. O conjunto de todas as solu\u00E7\u00F5es poss
\u00EDveis para um problema \u00E9 chamado de espa\u00E7o de
busca."@pt . <http://dbpedia.org/resource/Search_algorithm> <http://
www.w3.org/2000/01/rdf-schema#comment> 'Em ci \ u00EAncia da computa \
u00E7 \ u00E3o, um algoritmo busca de , em thermos gerais, \ u00E9
algoritmo um um problema que toma como entrada e retorna a cell \
u00E7 \ u00E3o para o problema, geralmente ap \ u00F3s resolver um n \
u00FAmero poss \ u00EDvel cell de \ u00E7 \ u00F5es. maioria A dos
algoritmos estudados por cientistas da computa \ u00E7 \ u00E3o
resolvem problemas que s \ u00E3o algortimos de busca. O conjunto de
todas as cell \ u00E7 \ u00F5es poss \ u00EDveis para um problema \
u00E9 chamado de espa \ u00E7o busca de. "@ pt.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "Zoekalgoritme"@nl . <http://dbpedia.org/
resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#label> "Zoekalgoritme" @ nl.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> "Un algoritmo de b\u00FAsqueda es aquel
que est\u00E1 dise\u00F1ado para localizar un elemento con ciertas
propiedades dentro de una estructura de datos; por ejemplo, ubicar el
registro correspondiente a cierta persona en una base de datos, o el
mejor movimiento en una partida de ajedrez. La variante m\u00E1s
simple del problema es la b\u00FAsqueda de un n\u00FAmero en un
vector."@es . <http://dbpedia.org/resource/Search_algorithm> <http://
www.w3.org/2000/01/rdf-schema#comment> "Un algoritmo de b \
u00FAsqueda aquel es que est \ u00E1 dise \ u00F1ado localizar para un
Elemento con ciertas Propiedades dentro de una estructura de Datos,
por ejemplo, el Registro ubicar correspondiente a cierta persona en
una base de Datos, o el mejor movimiento en una partida de Ajedrez. La
Variante m \ u00E1s simple del problema es la b \ u00FAsqueda de un n
\ u00FAmero en un vector. "@ es.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
property/hasPhotoCollection> <http://www4.wiwiss.fu-berlin.de/
flickrwrappr/photos/Search_algorithm> . <http://dbpedia.org/resource/
Search_algorithm> <http://dbpedia.org/property/hasPhotoCollection>
<http://www4.wiwiss.fu-berlin.de/flickrwrappr/photos/
Search_algorithm>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#comment> <http://dbpedia.org/resource/
Search_algorithm> <http://www.w3.org/2000/01/rdf-schema#comment> . .
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/wikiPageExternalLink> <http://sites.google.com/site/hantarto/
quantum-computing/unsorted> . <http://dbpedia.org/resource/
Search_algorithm> <http://dbpedia.org/ontology/wikiPageExternalLink>
<http://sites.google.com/site/hantarto/quantum-computing/unsorted>.
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/ns/
prov#wasDerivedFrom> <http://en.wikipedia.org/wiki/Search_algorithm?
oldid=495503577> . <http://dbpedia.org/resource/Search_algorithm>
<http://www.w3.org/ns/prov#wasDerivedFrom> <http://en.wikipedia.org/
wiki/Search_algorithm?oldid=495503577>.
<http://dbpedia.org/resource/Search_algorithm> <http://dbpedia.org/
ontology/abstract> <http://dbpedia.org/resource/Search_algorithm>
<http://dbpedia.org/ontology/abstract> . .
<http://dbpedia.org/resource/Search_algorithm> <http://www.w3.org/
2000/01/rdf-schema#label> "Hakualgoritmi"@fi . <http://dbpedia.org/
resource/Search_algorithm> <http://www.w3.org/2000/01/rdf-
schema#label> "search algorithm" @ en.
<script>_addload(function(){_setupIW();_csi('fi','en','http://
dbpedia.org/data/Search_algorithm.ntriples');});</script>

[vldm10]

In your post has a lot of web addresses. This is an interesting.
http://www.w3.org/TR/2012/PR-sparql11-query-20121108/

In section 10 Assignment, there is the following text: The value of an expression can be added to a mapping solution by binding a new variable to the value of the expression, Which is an RDF term.

In section 10.1 BIND: Variables Assignment, there is the following text: The BIND form allows a value to be assigned to a variable ...

In my paper "Semantic Databases and Semantic machines" see
http://www.dbdesign11.com/ , section 7.3, I wrote:

"In the sense of Frege's theory of names, we will define an assignment as the binding of names. In particular we will bind the name of a variable to the name of a value.
In programming languages we consider assignment to be the only atomic command.
So, the targets are locations of assignments and the assignments are sources of values. "

So I work assignment with the names of variables and values. I do not work assignment with the variables and values.

Perhaps these assignments look the same, but they are not. Note that my paper is from 10 April 2012 and the “w3” paper is from 08 November 2012. Thank you for this post.

Vladimir Odrljin

[vldm10]

> So, the targets are locations of assignments and the assignments are sources of values. "

I made mistake in this sentence. This sentence should be: So, the targets of assignments are locations and the sources of assignments are values.

Here, the locations are addresses in a memory. Note that “value” in my data model is an (abstract) object. Because “value” is an object, then it has a unique name. (See my paper, Semantic databases and semantic machines, at http://www.dbdesign11.com , section 1.
In definition 1.1(i), I wrote: “Abstract objects are recorded, meaning that they are permanent.” So an abstract object (i.e. a value) has an address in a memory.

Regarding “binding”, if we need, then we can apply database objects. Note that a variable can have a history. On the other hand, a name of a value can be “bind” to many variable names.

Regarding “values”, please note that I defined the following two kinds of attributes: “universal attributes” and “particular attributes” (See my paper “Database design and data model founded on concept and knowledge constructs, Section 3.3 at http://www.dbdesign10.com )

Recently (in his post “Very simple questions to relational theorists”), Evgeniy claims that the names are not relational. He is right. Names are related to semantics.

Vladimir Odrljin

[vldm10]

>(See my paper “Database design and data model founded on concept and knowledge > > constructs, Section 3.3 at http://www.dbdesign10.com )

Instead of http://www.dbdesign10.com
should be http://www.dbdesign11.com

[Martin Musatov]

thank you