divide-and-conquer approach

divide-and-conquer approach
метод разобщения (напр., компонентов БИС для осуществления оптимальной трассировки межсоединений)

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Нужно сделать НИР?

Смотреть что такое "divide-and-conquer approach" в других словарях:

  • Divide-and-conquer eigenvalue algorithm — Divide and conquer eigenvalue algorithms are a class of eigenvalue algorithms for Hermitian or real symmetric matrices that have recently (circa 1990s) become competitive in terms of stability and efficiency with more traditional algorithms such… …   Wikipedia

  • Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… …   Wikipedia

  • James Madison: A Plurality of Interests and a Balance of Powers — ▪ Primary Source              In the federal Convention of 1787, James Madison was the acknowledged leader of the group favoring a strong central government. The final draft of the Constitution did not fully satisfy Madison, for he thought the… …   Universalium

  • United Electrical, Radio and Machine Workers of America — Infobox Union name= UE country= United States affiliation= Independent, ICEM, PSI members= 35,000 full name= United Electrical, Radio and Machine Workers of America native name= founded= 1936 current= head= dissolved date= dissolved state= merged …   Wikipedia

  • Cache-oblivious algorithm — In computing, a cache oblivious algorithm is an algorithm designed to exploit the CPU cache without having the size of the cache (or the length of the cache lines, etcetera) as an explicit parameter. An optimal cache oblivious algorithm is a… …   Wikipedia

  • Closest pair of points problem — Closest pair of points shown in red The closest pair of points problem or closest pair problem is a problem of computational geometry: given n points in metric space, find a pair of points with the smallest distance between them. Its two… …   Wikipedia

  • X-Machine Testing — The (Stream) X Machine Testing Methodology is a complete functional testing approach to software and hardware testingM. Holcombe and F. Ipate (1998) Correct Systems Building a Business Process Solution . Springer, Applied Computing Series.] that… …   Wikipedia

  • HISTORICAL SURVEY: THE STATE AND ITS ANTECEDENTS (1880–2006) — Introduction It took the new Jewish nation about 70 years to emerge as the State of Israel. The immediate stimulus that initiated the modern return to Zion was the disappointment, in the last quarter of the 19th century, of the expectation that… …   Encyclopedia of Judaism

  • Mongol military tactics and organization — The Mongol military tactics and organization helped the Mongol Empire to conquer nearly all of continental Asia, the Middle East and parts of eastern Europe. In many ways, it can be regarded as the first modern military system. The original… …   Wikipedia

  • Major houses in A Song of Ice and Fire — The following is a list of the notable characters in George R. R. Martin s A Song of Ice and Fire series of epic fantasy novels, belonging to one of the major aristocratic houses of fictional Westeros, and explains in detail what happens to these …   Wikipedia

  • Mill, John Stuart: Logic and metaphysics — J.S.Mill Logic and metaphysics John Skorupski ENLIGHTENMENT AND ROMANTICISM IN MILL’S PHILOSOPHY Mill’s importance as one of the major figures of nineteenth century politics and culture, and the current interest in him as a moral and political… …   History of philosophy


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»