- unassigned variable
- неинициализированная переменная
Большой англо-русский и русско-английский словарь. 2001.
unassigned variable
Смотреть что такое "unassigned variable" в других словарях:
Look-ahead (backtracking) — In backtracking algorithms, look ahead is the generic term for a subprocedure that attempts to foresee the effects of choosing a branching variable to evaluate or one of its values. The two main aims of look ahead are to choose a variable to… … Wikipedia
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
Backtracking — is a type of algorithm that is a refinement of brute force search. [cite web | url=http://www.cse.ohio state.edu/ gurari/course/cis680/cis680Ch19.html#QQ1 51 128 Backtracking algorithms | title=CIS 680: DATA STRUCTURES: Chapter 19: Backtracking… … Wikipedia
Constraint learning — In constraint satisfaction backtracking algorithms, constraint learning is a technique for improving efficiency. It works by recording new constraints whenever an inconsistency is found. This new constraint may reduce the search space, as future… … Wikipedia
Constraint optimization — In constraint satisfaction, constrained optimization (also called constraint optimization) seeks for a solution maximizing or minimizing a cost function. Contents 1 Definition 2 Solution methods 2.1 Branch and bound … Wikipedia
Definite assignment analysis — In computer science, definite assignment analysis is a data flow analysis used by compilers to conservatively ensure that a variable or location is always assigned to before it is used. Contents 1 Motivation 2 Terminology 3 The analysis … Wikipedia
Assignment (computer science) — In computer programming, an assignment statement sets or re sets the value stored in the storage location(s) denoted by a variable name. In most imperative computer programming languages, assignment statements are one of the basic statements.… … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
DNA virus — A DNA virus is a virus that has DNA as its genetic material and replicates using a DNA dependent DNA polymerase. The nucleic acid is usually double stranded DNA (dsDNA) but may also be single stranded DNA (ssDNA). DNA viruses belong to either… … Wikipedia
Dirichlet process — In probability theory, a Dirichlet process is a stochastic process that can be thought of as a probability distribution whose domain is itself a random distribution. That is, given a Dirichlet process , where H (the base distribution) is an… … Wikipedia
Unicode — For the 1889 Universal Telegraphic Phrase book, see Commercial code (communications). The Unicode official logo since October 2009 … Wikipedia
