- placement algorithm
- алгоритм размещения, алгоритм компоновки
Большой англо-русский и русско-английский словарь. 2001.
placement algorithm
Смотреть что такое "placement algorithm" в других словарях:
Automatic label placement — (sometimes called text placement or name placement) refers to the computer methods of placing labels automatically on a map or chart. This is related to the typographic design of such labels. Maps communicate spatial information to the reader,… … Wikipedia
Cayley-Purser algorithm — The Cayley Purser algorithm was a public key cryptography algorithm published in early 1999 by 16 year old Irishwoman Sarah Flannery, based on an unpublished work by Michael Purser, founder of Baltimore Technologies, a Dublin data security… … Wikipedia
Mark-compact algorithm — In computer science, a mark compact algorithm is a type of garbage collection algorithm used to reclaim unreachable memory. Mark compact algorithms can be regarded as a combination of the mark sweep algorithm and Cheney s copying algorithm. First … Wikipedia
Advanced Placement Computer Science — This article is part of the Advanced Placement series. General exam structure • Awards Current Subjects: Art History Biology Calculus (AB BC) Chemistry Chinese Language and Culture Comparative Government Politics… … Wikipedia
Reconfigurable computing — is a computer architecture combining some of the flexibility of software with the high performance of hardware by processing with very flexible high speed computing fabrics like field programmable gate arrays (FPGAs). The principal difference… … Wikipedia
Moonstone: A Hard Days Knight — For other uses, see Moonstone (disambiguation). Moonstone: A Hard Days Knight Developer(s) Mindscape Publisher(s) … Wikipedia
алгоритм размещения — алгоритм компоновки — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом Синонимы алгоритм компоновки EN placement algorithm … Справочник технического переводчика
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
Simulated annealing — (SA) is a generic probabilistic meta algorithm for the global optimization problem, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g.,… … Wikipedia
Force-based algorithms — Force based or force directed algorithms are a class of algorithms for drawing graphs in an aesthetically pleasing way. Their purpose is to position the nodes of a graph in two dimensional or three dimensional space so that all the edges are of… … Wikipedia
Eight queens puzzle — a b c d e f g h … Wikipedia
