About: Nondeterministic algorithm     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Rule105846932, within Data Space : dbpedia.org associated with source document(s)

In computer programming, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are several ways an algorithm may behave differently from run to run. A concurrent algorithm can perform differently on different runs due to a race condition. A probabilistic algorithm's behaviors depends on a random number generator. An algorithm that solves a problem in nondeterministic polynomial time can run in polynomial time or exponential time depending on the choices it makes during execution. The nondeterministic algorithms are often used to find an approximation to a solution, when the exact solution would be too costly to obtain using a deterministic one.

AttributesValues
rdf:type
rdfs:label
  • Nedeterministický algoritmus
  • Nichtdeterminismus
  • Nondeterministic algorithm
  • Algoritmo no determinista
  • 비결정론적 알고리즘
  • Algoritmo não determinístico
  • Недетермінований алгоритм
rdfs:comment
  • En ciencias de la computación, un algoritmo no determinista es un algoritmo que con la misma entrada ofrece muchos posibles resultados, y por tanto no ofrece una solución única. No se puede saber de antemano cuál será el resultado de la ejecución de un algoritmo no determinista.
  • 비결정론적 알고리즘(영어: Nondeterministic algorithm)은 결정론적 알고리즘과는 달리, 동일한 입력이 주어지더라도 매번 다른 과정을 거쳐 다른 결과를 도출하는 알고리즘을 의미한다.
  • Em ciência da computação, um algoritmo não determinístico é um algoritmo em que, dada uma certa entrada, pode apresentar comportamentos diferentes em diferentes execuções, ao contrário de um algoritmo determinístico. Um pode executar de forma diferente em diferentes execuções devido a uma condição de concorrência. O comportamento de um depende de um gerador de números aleatórios. Um algoritmo que resolve um problema de pode ser executado em tempo polinomial ou tempo exponencial em função das escolhas que faz durante a execução.
  • В інформатиці, недетермінований алгоритм це алгоритм, який передбачає декілька шляхів обробки одних і тих самих вхідних даних, без будь-якого уточнення який саме варіант буде обраний.
  • Nedeterministický algoritmus (= stochastický) je takový algoritmus, který v některých krocích může volit z několika možností dalších kroků, což je rozdíl oproti deterministickému algoritmu, kde je následující krok vždy definován jednoznačně. Nedeterministický algoritmus při stejném vstupu může dávat rozdílné výsledky. Lze zkoumat množinu všech výsledků nedeterministického algoritmu a určovat
  • In computer programming, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are several ways an algorithm may behave differently from run to run. A concurrent algorithm can perform differently on different runs due to a race condition. A probabilistic algorithm's behaviors depends on a random number generator. An algorithm that solves a problem in nondeterministic polynomial time can run in polynomial time or exponential time depending on the choices it makes during execution. The nondeterministic algorithms are often used to find an approximation to a solution, when the exact solution would be too costly to obtain using a deterministic one.
foaf:depiction
  • External Image
foaf:isPrimaryTopicOf
thumbnail
dct:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
sameAs
dbp:wikiPageUsesTemplate
has abstract
  • Nedeterministický algoritmus (= stochastický) je takový algoritmus, který v některých krocích může volit z několika možností dalších kroků, což je rozdíl oproti deterministickému algoritmu, kde je následující krok vždy definován jednoznačně. Nedeterministický algoritmus při stejném vstupu může dávat rozdílné výsledky. Lze zkoumat množinu všech výsledků nedeterministického algoritmu a určovat * zda existuje alespoň jeden výsledek vyhovující zadání. Příkladem tohoto využití je nedeterministický konečný automat. * Pravděpodobnost provedení některých kroků algoritmu, pokud jsou známy pravděpodobnosti výběru dalších kroků algoritmu. Problémy tohoto typu zkoumá například teorie hromadné obsluhy.
  • En ciencias de la computación, un algoritmo no determinista es un algoritmo que con la misma entrada ofrece muchos posibles resultados, y por tanto no ofrece una solución única. No se puede saber de antemano cuál será el resultado de la ejecución de un algoritmo no determinista.
  • In computer programming, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are several ways an algorithm may behave differently from run to run. A concurrent algorithm can perform differently on different runs due to a race condition. A probabilistic algorithm's behaviors depends on a random number generator. An algorithm that solves a problem in nondeterministic polynomial time can run in polynomial time or exponential time depending on the choices it makes during execution. The nondeterministic algorithms are often used to find an approximation to a solution, when the exact solution would be too costly to obtain using a deterministic one. The notion was introduced by Robert W. Floyd in 1967.
  • 비결정론적 알고리즘(영어: Nondeterministic algorithm)은 결정론적 알고리즘과는 달리, 동일한 입력이 주어지더라도 매번 다른 과정을 거쳐 다른 결과를 도출하는 알고리즘을 의미한다.
  • Em ciência da computação, um algoritmo não determinístico é um algoritmo em que, dada uma certa entrada, pode apresentar comportamentos diferentes em diferentes execuções, ao contrário de um algoritmo determinístico. Um pode executar de forma diferente em diferentes execuções devido a uma condição de concorrência. O comportamento de um depende de um gerador de números aleatórios. Um algoritmo que resolve um problema de pode ser executado em tempo polinomial ou tempo exponencial em função das escolhas que faz durante a execução.
  • В інформатиці, недетермінований алгоритм це алгоритм, який передбачає декілька шляхів обробки одних і тих самих вхідних даних, без будь-якого уточнення який саме варіант буде обраний.
prov:wasDerivedFrom
page length (characters) of wiki page
gold:hypernym
is foaf:primaryTopic of
is Link from a Wikipage to another Wikipage of
Faceted Search & Find service v1.17_git81 as of Jul 16 2021


Alternative Linked Data Documents: PivotViewer | ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3322 as of Jul 22 2021, on Linux (x86_64-generic-linux-glibc25), Single-Server Edition (61 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2021 OpenLink Software