Wyniki wyszukiwania dla: ASYMPTOTIC STABILITY - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: ASYMPTOTIC STABILITY

Filtry

wszystkich: 55

wyczyść wszystkie filtry


Filtry wybranego katalogu

  • Kategoria

  • Rok

  • Opcje

wyczyść Filtry wybranego katalogu niedostępne

Wyniki wyszukiwania dla: ASYMPTOTIC STABILITY

  • Effect of MgSO4 nutrition on Theobroma cacao L. susceptibility to Phytophthora megakarya infection

    Publikacja
    • E. Minyaka
    • B. Madina
    • B. Kusznierewicz
    • O. Doungous
    • S. Haouni
    • J. Hawadak
    • N. Niemenak
    • D. N. Omokolo

    - PLANT PROTECTION SCIENCE - Rok 2018

    A new strategy to reduce the severity of black pod disease (BPD) in T. cacao plants using MgSO4 nutrition was investigated. The dynamics of the tolerance to BPD of 18 susceptible T. cacao plantlets coming from the cross (♀SNK64 × ♂UPA14) was monitored during weekly (8 weeks) supply of MgSO4 into the soil. Prior to MgSO4 application, disease scores of the 18 plantlets (in six sets of three plantlets per set) were varying between...

    Pełny tekst do pobrania w portalu

  • Asymmetric Renyi Problem and > PATRICIA Tries

    Publikacja

    - Rok 2016

    In 1960 R´enyi asked for the number of random queries necessary to recover a hidden bijective labeling of n distinct objects. In each query one selects a random subset of labels and asks, what is the set of objects that have theselabels? Weconsider here anasymmetric version of the problem in which in every query an object is chosenwith probability p > 1/2 and we ignore “inconclusive” queries. We study the number of queries needed...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Fast collaborative graph exploration

    Publikacja

    - INFORMATION AND COMPUTATION - Rok 2015

    We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...

    Pełny tekst do pobrania w portalu

  • Fast Collaborative Graph Exploration

    Publikacja

    - LECTURE NOTES IN COMPUTER SCIENCE - Rok 2013

    We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Weak Stability of Centred Quadratic Stochastic Operators

    Publikacja

    We consider the weak convergence of iterates of so-called centred quadratic stochastic operators. These iterations allow us to study the discrete time evolution of probability distributions of vector-valued traits in populations of inbreeding or hermaphroditic species, whenever the offspring’s trait is equal to an additively perturbed arithmetic mean of the parents’ traits. It is shown that for the existence of a weak limit, it...

    Pełny tekst do pobrania w portalu