|
|
|
|
|
|
|
|
|
Decision list
| Глоссарий по искусственному интеллекту |
A k-decision list is an ordered sequence of k if-then-else rules. each rule in the sequence is tested until one of the rules is satisfied. when the rule is satisfied, the action associated with that rule is taken, both the k term conjunctive normal form (cnf) and the k-term disjunctive normal form (dnf) can be represented by kdecision lists, which are probably approximately correct (pac) learnable see also: machine learning, probably approximately correct learning model.
|
|
Decision, английский
- Решение
- N решение; принятие ре- шения task lexical ~ принятие решения о понимании значения слова
- Решение о to render ~ принимать [выносить] решение
- The willful imposition of a constraint on a set of initially possible alternatives. in the extreme case, the choice of one from a set of initially conceivable but after the decision and by virtue of that decision no longer available courses of action, messages, objects, properies, etc. the power of a decision is measured by the dual logarithm of the logical probability of the remaining to the initial set of possibilities (->information, ->law of requisite variety, ->bit).
- In an activity diagram, a guard condition that indicates different possible transitions from an action state. if one of these transitions leads to another decision, that decision is represented with the traditional diamond shape.
- The conclusion or resolution reached after careful consideration or deliberation, often in the context of a coaching or mentoring relationship.
Decision (in sdl), английский
Decision (to make, английский
Decision algorithm, английский
Алгоритм принятия решения; алгоритм выбора решения
Decision alternative, английский
Альтернатива возможного решения
Decision altitude/decision height, английский
Decision analysis, английский
Анализ выработки решений
Decision area, английский
Decision assessment, английский
Оценка решения
Decision attribute, английский
Decision attributes are the output or target variables in a rough set data analysis. the predictor or classification attributes are called condition attributes, as the decision is conditioned on the values of these attributes. see also: condition attributes, rough set.
Decision box, английский
- Блок принятия решения (блок сети или алгоритма)
- Блок ветвления; блок проверки условия; блок принятия решения
Decision break-point analysis, английский
A type of sensitivity analysis that indicates the value at which a key variable will result in a negative npv for an investment project.
Decision circuit, английский
Decision contents, английский
Решение
Decision controlled adaptation, английский
Адаптация с решающей обратной связью; адаптация с управлением по решению
Decision critical path method, английский
Принятие решения на основе метода критического пути
Decision destroyer, английский
An nlp technique in which you install a resource on the timeline that precedes a negative event, which has the effect of changing the event.
Decision du jury de lever l'accusation, французский
Decision element, английский
Решающий элемент
Decision engine, английский
Software or service able to process a large amount of data and provide reports that help users make more informed decisions.
Decision event, английский
Определяющее событие (точка сетевого графика, в которой принимается руководящее решение)
Associated, английский
- Соответствующий; связанный; присоединенный
- Experiencing through your own senses (seeing through your own eyes, hearing with your own ears, feeling with your own feelings.)
Conjunctive, английский
A 1 соединительный; 2 сослагательный adverb, mood, pronoun
Disjunctive, английский
N разделительный союз disjuncture n разъединение
Approximately, английский
- Approx.
- Приблизительно
- Приблизительно, около
Approximate, английский
- Приблизительный ар-ps ammonium perchlorate-poly- styrene (propellant) полистирол- перхлоратаммониевое ракетное топливо
- Приблизительный
- Приблизительно
|
Karnaugh map, английский
A karnaugh map is a method for displaying multi-attribute binary relations in a single cross-classification. the attributes are combined into two groups, and, within each group, are stacked to create two compound attributes. these are used to create a cross-classification with the response as the entry. table k.1 shows a hypothetical truth table for three attributes, and table k.2 shows karnaugh map of table k.1. table k.1 — truth table
Procedural representation, английский
A knowledge base that uses a procedural representation (as opposed to a declarative representation) represents knowledge as a series of procedures and associated data structures. an example would be a knowledge base that contains a "person" procedure. this procedure would contain a list of persons, such as socrates, aristotle, archie bunker, and plato. when executed with an argument of "descartes," the person procedure would search its list of persons and return false. a further procedure called "mortal" could build on this with a list of mortal things, including the persons() function. then, the call mortal("plato``) would eventually invoke the person("plato") and return true. this form of representation has the advantage that it explicitly directs the method and order of query evaluation, but it can be very difficult to change when a new fact is added. hybrid methods, such as patterndirected invocation have been developed to overcome the limits of this form of representation. see also: declarative representation, knowledge base, knowledge representation.
|
|
|
|
|
|
|
