- randomized solution
- мат. рандомизированное решение
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Greedy randomized adaptive search procedure — The greedy randomized adaptive search procedure (also known as GRASP) is a metaheuristic algorithm commonly applied to combinatorial optimization problems. GRASP typically consists of iterations made up from successive constructions of a greedy… … Wikipedia
Greedy randomized adaptive search procedure — est une métaheuristique, c est à dire un algorithme d’optimisation visant à résoudre des problèmes d’optimisation difficile pour lesquels on ne connaît pas de méthode classique plus efficace. Introduite dans l article Feo and Resende (1989),… … Wikipédia en Français
Restricted randomization — Many processes have more than one source of variation in them. In order to reduce variation in processes, these multiple sources must be understood, and that often leads to the concept of nested or hierarchical data structures. For example, in… … Wikipedia
Homeopathy — Homeopathy: coined in German from Greek hómoios ὅμοιος like + páthos πάθος suffering Oxford English Dictionary … Wikipedia
Epidural — This article is about the anaesthetic technique. For the anatomical site, see Epidural space. For other uses, see Epidural (disambiguation). Did you mean Epidural hematoma, a type of traumatic brain injury? Epidural Intervention … Wikipedia
Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity. Computer scientist Manindra Agrawal of the… … Universalium
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Graeco-Latin square — Orthogonal Latin squares of order 3 Orthogonal Latin squares of order 5 In mathematics, a Graeco Latin square or Euler square or orthogonal Latin squares of order n over two … Wikipedia
Linear programming relaxation — In mathematics, the linear programming relaxation of a 0 1 integer program is the problem that arises by replacing the constraint that each variable must be 0 or 1 by a weaker constraint, that each variable belong to the interval [0,1] .That is,… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
Hemoglobin-based oxygen carriers — At the beginning of 20th century excellent work of Landsteiner and co authors combine with significant progress in fields of heart and circulation physiology initiated development of modern transfusion medicine allowing that blood transfusion… … Wikipedia