Dijkstra's algorithm - Dijkstra's algorithm finds minimum-total-cost paths from a starting node in a weighted graph whose edge weights are nonnegative.
Dinitz - Dinitz is a maximum-flow algorithm that increases the amount of a single commodity sent from a source to a sink while respecting edge capacities and flow...
Directed acyclic graph - A directed acyclic graph, or DAG, is a graph whose edges have directions and which contains no directed cycle.
Directed graph - A directed graph, also called a digraph, represents objects as nodes and relationships as arrows from one node to another.
Directional arc consistency - Directional arc consistency, or DAC, is a constraint-satisfaction property defined relative to a fixed ordering of variables.
Dirichlet process - A Dirichlet process is a probability distribution over probability distributions.
Disambiguation - Disambiguation is the process of determining which interpretation of an expression is intended when more than one is possible.
Discount factor - A discount factor is a number used to reduce the weight of later rewards relative to earlier rewards in a sequential decision problem.
Discrete events - In knowledge representation, discrete events are occurrences with a definite structure and identifiable boundaries.
Discretization - Discretization represents a continuous quantity or space using a set of distinct values, categories, intervals, or grid points.
Disjunctive constraint - A disjunctive constraint requires at least one of several alternative conditions to hold. Its logical form is an OR between constraints.
Disparity - Disparity, in stereo vision, is the difference between the image positions of corresponding scene points in two views.
Dispersion - Dispersion, in the network-analysis sense used here, measures how separated the mutual neighbors of two connected nodes are from one another.
Distance-Regular Graphs - Distance-regular graphs are connected graphs whose local connection counts around pairs of vertices depend on their graph distance rather than on the...
Distributed constraint satisfaction - Distributed constraint satisfaction is a way of solving a constraint problem in which variables, constraints, or decision responsibilities are distributed...
Distributed representation - A distributed representation encodes an item through a pattern across several representational units, with individual units participating in the...
Distributed tree search - Distributed tree search divides the exploration of a search tree among cooperating processors or workers.
Divisive Communities - Divisive communities are groups identified by progressively splitting a graph into smaller parts.
Domain closure - Domain closure is an assumption that every object in a modeled domain is accounted for by the specified names or ground terms.
Domain elements - Domain elements are the objects that belong to the domain of a logical model. They are what variables range over and what names or other terms can refer to.
Dominant strategy - A dominant strategy is a strategy that gives a player an outcome at least as good as every alternative, whatever strategies the other players choose, under...
Dominant strategy equilibrium - A dominant strategy equilibrium is a joint choice of strategies in which every player uses a dominant strategy.
Double hashing - Double hashing is an open-addressing method for resolving collisions in a hash table.
Doubly block circulant - Doubly block circulant describes a matrix built from a circulant arrangement of blocks, with each block itself circulant.
Downward refinement property - The downward refinement property is a property of a planning abstraction hierarchy that allows abstract solutions to be refined into concrete solutions...
Dropping conditions - Dropping conditions is a generalization operation in rule or concept learning that removes one or more requirements from a conjunctive description.
Dual graph - In constraint satisfaction, a dual graph represents each original constraint as a node and connects two nodes when their constraints share one or more...
Duration - Duration is the amount of time an action or activity takes between its start and end.
Dynamic backtracking - Dynamic backtracking is a constraint-search method that revises a decision responsible for a conflict while preserving other assignments that need not be...
Dynamic perfect hashing - Dynamic perfect hashing is a method for maintaining a changing dictionary of keys while preserving collision-free placement for the currently stored set...
Dynamic search problems - Dynamic search problems are search problems whose relevant description changes over time, such as changing edge costs, newly discovered obstacles, or a...
Dynamic state - A dynamic state describes the quantities needed to model how a system will evolve under its dynamics.
Early goal test - An early goal test checks whether a newly generated search node satisfies the goal before the node is later selected from the frontier for expansion.
Edge-augmentation - Edge-augmentation is the process of adding edges to a graph to achieve a desired structural property.
Edgelist - An edgelist, or edge list, represents a graph by listing its connections, usually one edge per record with two endpoint identifiers and optional edge...
Edmonds-Karp - Edmonds-Karp is an algorithm for finding a maximum flow from a source to a sink in a capacitated network.
Effective branching factor - The effective branching factor is a summary measure that compares a search's node count with a hypothetical uniform tree of the same solution depth.
Effective depth - Effective depth is an analytical way to describe search effort as though a search had explored a shallower tree than an uninformed baseline.
Elitism - Elitism is an evolutionary-search mechanism that preserves one or more of the best current candidate solutions when forming the next population.
Empirical loss - Empirical loss is the loss measured on a finite set of observed examples, usually calculated as the average of a per-example loss function.
End-to-end learning - End-to-end learning trains a system's learnable processing stages together using an objective tied to its final output.
English auction - An English auction is an ascending-price auction in which participants compete through increasing bids, or remain active as a displayed price rises.
Entailment - Entailment is a relationship in logic: a set of statements entails another statement when every interpretation that makes the starting statements true also...
Environment class - An environment class is a collection of possible environments used to specify, study, or evaluate an intelligent agent.
Epigraph - The epigraph of a function is the set of points on or above its graph.
Epsilon-ball - An epsilon-ball is a neighborhood of points within a specified distance epsilon of a chosen center.
Equal impact - Equal impact is a fairness objective concerned with the benefits and costs that a decision system creates for affected people.