| slovo | definícia |
heuristic
(encz) | heuristic,heuristický adj: Zdeněk Brož |
Heuristic
(gcide) | Heuristic \Heu*ris"tic\ (h[-u]*r[i^]s"t[i^]k), n.
1. A heuristic method; a specific heuristic procedure.
[PJC]
2. A theory or approach which serves to promote discovery or
learning by encouraging experimentation.
[PJC] |
Heuristic
(gcide) | Heuristic \Heu*ris"tic\ (h[-u]*r[i^]s"t[i^]k), a. [Gr.
e"yri`skein to discover.]
1. Serving to promote discovery or learning; -- used
especially of thories or paradigms which stimulate new
ideas for discovering facts in experimental sciences.
[1913 Webster +PJC]
2. Serving to stimulate people to learn and discover on their
own, especially by encouraging experimental and
trial-and-error methods for solving problems.
[PJC]
3. Pertaining to or based on trial-and-error and experimental
methods of learning and evaluation.
[PJC]
4. (Computers) Based on the use of an efficient trial-and
error method to search a space of possible solutions to a
problem, or to find an acceptable approximate solution,
when an exact algorithmic method is unavailable or too
time-consuming.
[PJC] |
heuristic
(wn) | heuristic
adj 1: of or relating to or using a general formulation that
serves to guide investigation [ant: algorithmic]
n 1: a commonsense rule (or set of rules) intended to increase
the probability of solving some problem [syn: heuristic,
heuristic rule, heuristic program] |
heuristic
(foldoc) | heuristic
non-algorithmic procedure
1. A rule of thumb, simplification, or educated
guess that reduces or limits the search for solutions in
domains that are difficult and poorly understood. Unlike
algorithms, heuristics do not guarantee optimal, or even
feasible, solutions and are often used with no theoretical
guarantee.
2. approximation algorithm.
(2001-04-12)
|
| | podobné slovo | definícia |
heuristic program
(encz) | heuristic program, n: |
heuristic rule
(encz) | heuristic rule, n: |
heuristically
(encz) | heuristically,heuristicky adv: Zdeněk Brož |
heuristicky
(czen) | heuristicky,heuristicallyadv: Zdeněk Brož |
heuristický
(czen) | heuristický,heuristicadj: Zdeněk Brož |
Heuristic
(gcide) | Heuristic \Heu*ris"tic\ (h[-u]*r[i^]s"t[i^]k), n.
1. A heuristic method; a specific heuristic procedure.
[PJC]
2. A theory or approach which serves to promote discovery or
learning by encouraging experimentation.
[PJC]Heuristic \Heu*ris"tic\ (h[-u]*r[i^]s"t[i^]k), a. [Gr.
e"yri`skein to discover.]
1. Serving to promote discovery or learning; -- used
especially of thories or paradigms which stimulate new
ideas for discovering facts in experimental sciences.
[1913 Webster +PJC]
2. Serving to stimulate people to learn and discover on their
own, especially by encouraging experimental and
trial-and-error methods for solving problems.
[PJC]
3. Pertaining to or based on trial-and-error and experimental
methods of learning and evaluation.
[PJC]
4. (Computers) Based on the use of an efficient trial-and
error method to search a space of possible solutions to a
problem, or to find an acceptable approximate solution,
when an exact algorithmic method is unavailable or too
time-consuming.
[PJC] |
heuristically
(gcide) | heuristically \heu*ris"ti*cal*ly\
(h[-u]*r[i^]s"t[i^]*kal*l[y^]), n.
In a heuristic manner; by using a heuristic method; by
serving as a heuristic method; as, a heuristically guided
search technique; a heuristically valuable theory.
[PJC] |
heuristic program
(wn) | heuristic program
n 1: a commonsense rule (or set of rules) intended to increase
the probability of solving some problem [syn: heuristic,
heuristic rule, heuristic program] |
heuristic rule
(wn) | heuristic rule
n 1: a commonsense rule (or set of rules) intended to increase
the probability of solving some problem [syn: heuristic,
heuristic rule, heuristic program] |
heuristics testing
(foldoc) | failure-directed testing
heuristics testing
(Or "heuristics testing") Software testing based
on the knowledge of the types of errors made in the past
that are likely for the system under test.
(1996-05-16)
|
metaheuristic
(foldoc) | metaheuristic
A top-level general
strategy which guides other heuristics to search for
feasible solutions in domains where the task is hard.
Metaheuristics have been most generally applied to problems
classified as NP-Hard or NP-Complete by the theory of
computational complexity. However, metaheuristics would
also be applied to other combinatorial optimisation
problems for which it is known that a polynomial-time
solution exists but is not practical.
Examples of metaheuristics are Tabu Search, {simulated
annealing}, genetic algorithms and memetic algorithms.
(1997-10-30)
|
|