نتایج جستجو برای: popular sayings

تعداد نتایج: 107267  

2015
Sayan Bhattacharya Martin Hoefer Chien-Chung Huang Telikepalli Kavitha Lisa Wagner

We study dynamic matching problems in graphs among agents with preferences. Agents and/or edges of the graph arrive and depart iteratively over time. The goal is to maintain matchings that are favorable to the agent population and stable over time. More formally, we strive to keep a small unpopularity factor by making only a small amortized number of changes to the matching per round. Our main ...

2002

Figurative Note. Abstract images are constructed by an algorithm that randomly assigns elements to adesign. Painted figurative images conform to complexity level in corresponding VDT Abstract.Both VDT Abstract and Figurative images were co-calibrated to define a common artistic judg-ment aptitude construct.PERSONS MAP OF ITEMS| +|. |||...

2008
TOM SANDERS

We provide further explanation of the significance of an example in a recent paper of Wolf in the context of the problem of finding large subspaces in sumsets. Throughout these notes G will denote the group F2 , that is the n-dimensional vector space over F2, and PG will denote the normalized counting measure on G. The convolution of two functions f, g ∈ L(PG) is defined to be f ∗ g(x) := ∫

Journal: :New biotechnology 2010
Alan McHughen Robert Wager

Agricultural biotechnology, especially genetic engineering or genetic modification (GM), is a topic of considerable controversy worldwide. The public debate is fraught with polarized views and opinions, some are held with religious zeal. Unfortunately, it is also marked with much ignorance and misinformation. Here we explore some popular misconceptions encountered in the public debate.

2003
David K. Naugle Richard Niebuhr

2016
Telikepalli Kavitha

In an instance G = (A∪B,E) of the stable marriage problem with strict and possibly incomplete preference lists, a matchingM is popular if there is no matchingM ′ where the vertices that prefer M ′ to M outnumber those that prefer M to M ′. All stable matchings are popular and there is a simple linear time algorithm to compute a maximum-size popular matching. More generally, what we seek is a mi...

Journal: :Vestnik Tverskogo gosudarstvennogo universiteta 2021

В статье ставится задача проанализировать общий корпус пословиц и поговорок российских немцев выделить наиболее часто встречающиеся группы реалий - названия предметов явлений духовной материальной культуры. освещается опыт исследователей Вятского государственного университета, а также используется метод комплексного анализа при сборе обработке языкового материала носителей немецких островных ди...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید