Multiattribute utility theory - Multiattribute utility theory is a framework for representing preferences over outcomes described by several attributes, such as delivery speed...
Multibody planning - Multibody planning is planning for several physically separate bodies, such as a fleet of robots, whose actions must be coordinated to achieve an overall...
Multieffector planning - Multieffector planning is planning for a decision-making system with several effectors that can act, sometimes concurrently, on its environment.
Multiple inheritance - Multiple inheritance means that a class or category has more than one parent from which it inherits applicable characteristics.
Multiplexer - A multiplexer, often shortened to mux, selects one of several input signals and passes the selected signal to an output. Control inputs determine the selection.
Multiplicative binary search - Multiplicative binary search is a binary-search variant that searches keys stored in the level-order layout of an implicit binary search tree.
Multivariate Gaussian - A multivariate Gaussian, also called a multivariate normal distribution, is a probability distribution for a vector of numerical variables considered jointly.
Mutation - In evolutionary computation, mutation is an operator that changes a candidate solution to create a variant for evaluation.
Mutation rate - Mutation rate is a parameter controlling how frequently mutation is attempted or applied in an evolutionary algorithm.
Mutual preferential independence - Mutual preferential independence is a condition on preferences across several attributes: every subset of attributes is preferentially independent of its...
Mutual Reachability Graph - A mutual reachability graph is a weighted graph used in density-based hierarchical clustering, notably HDBSCAN. Each data point is a vertex.
Mutually utility independent - Attributes are mutually utility independent when every subset is utility independent of its complement: preferences over lotteries on that subset do not...
Named graph - A named graph is an RDF graph associated with a graph name inside an RDF dataset.
Natural sort order - Natural sort order is an approach to ordering mixed text and numbers so that digit sequences are typically compared by their numerical values.
Negation - Negation is the logical operation that states that a proposition is not true.
Network Simplex - Network simplex is an optimization algorithm for finding a minimum-cost flow through a network while satisfying supply, demand, and capacity constraints.
Newton-Raphson - Newton-Raphson is an iterative numerical method for finding a root of a function: an input x for which f(x)=0.
No-good - A no-good is a combination of variable assignments that cannot be extended into a valid solution of a constraint satisfaction problem.
No-regret learning - No-regret learning is a way of making repeated decisions so that the learner's average performance approaches that of a specified hindsight benchmark.
Node - A node is an individual element of a graph or tree, often representing an entity, state, variable, or operation. Connections between nodes are called edges.
Noise-based logic - Noise-based logic is a research approach in which distinguishable noise signals represent logical values and specially designed operations manipulate those...
Non-randomness - Non-randomness, in the supplied graph-analysis context, is a spectral measure intended to characterize structure in a network relative to a random-graph model.
Nonlinear constraints - Nonlinear constraints are restrictions on decision variables that involve relationships beyond linear combinations, such as products of variables, squares...
Nonmonotonicity - Nonmonotonicity is the property of a reasoning system in which adding information can invalidate a previously supported conclusion.
Nonparametric density estimation - Nonparametric density estimation estimates the shape of a probability distribution from observed data without restricting it to a fixed finite-dimensional...
Nonparametric model - A nonparametric model is a statistical or machine-learning model whose flexibility is not restricted to a fixed finite-dimensional parameterization chosen...
Nonserial dynamic programming - Nonserial dynamic programming is a method for solving structured problems by eliminating variables and storing summaries of their interactions with the...
NP-complete - NP-complete describes a decision problem that is both in NP and NP-hard under the specified polynomial-time reductions.
NP-completeness - NP-completeness is the complexity-theoretic property of a decision problem that is both efficiently verifiable and at least as hard as every problem in NP...
Null move - A null move is a hypothetical move in which a player passes the turn without making an ordinary action on the board.
Null-move heuristic - The null-move heuristic is a selective game-search technique that tests a position by hypothetically passing the current player's turn and searching the...
Occupancy grid - An occupancy grid is a spatial map divided into cells, with each cell storing an estimate of whether that part of the environment is occupied.
Occupied space - Occupied space is the region physically taken up by a robot, obstacle, or other object.
Occur check - An occur check, more commonly called an occurs check, tests whether a variable appears inside a term before binding that variable to the term during...
Ockham's razor - Ockham's razor, also spelled Occam's razor, is a preference for avoiding unnecessary complexity when choosing among explanations or models.
Offline inference - Offline inference is the use of a trained machine-learning model to generate predictions in advance, usually for a collection of known inputs, and store...
Offline search - Offline search is a problem-solving approach in which an agent computes a solution using a model before executing the corresponding actions in the environment.
Omniscience - Omniscience means complete knowledge.
Online inference - Online inference is the use of a trained model to generate a prediction when an application requests it.
Online Inference Pipeline - An online inference pipeline is the sequence of processing steps that turns a prediction request into a response using a deployed machine-learning model.
Online replanning - Online replanning is the process of revising a plan while an agent is carrying out its task, using new observations or changed conditions.
Online search - Online search is problem solving that interleaves computation with actions and observations in an environment.
Ontological commitment - An ontological commitment is a choice about what kinds of things a representation treats as existing and how its vocabulary refers to them.
Ontological engineering - Ontological engineering is the disciplined work of designing, evaluating, and maintaining explicit models of the concepts and relationships in a domain.
Ontology - An ontology is an explicit model of the concepts, entities, and relationships relevant to a domain, with definitions that clarify their meanings.
Ontology engineering - Ontology engineering is the systematic development and maintenance of a shared model of domain concepts, relationships, and assumptions.
Open-loop - Open-loop describes a control or action process that does not use feedback from the controlled result to revise its commands during the relevant execution...