نتایج جستجو برای: weak log majoriz ation

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

2000
Stefan Edelkamp Patrick Stiegeler

With re nements to the WEAK-HEAPSORT algorithm we establish the general and practical relevant sequential sorting algorithm RELAXED-WEAK-HEAPSORT executing exactly ndlog ne 2 ne + 1 n log n 0:9n comparisons on any given input. The number of transpositions is bounded by n plus the number of comparisons. Experiments show that RELAXED-WEAK-HEAPSORT only requires O(n) extra bits. Even if this space...

Journal: :Drug metabolism and disposition: the biological fate of chemicals 2009
Tanya Hay Rhys Jones Kevin Beaumont Mark Kemp

The relationship between rat pharmacokinetics and physicochemical parameters [the partition coefficient between octanol and buffer at pH 7.4 (log D((7.4))) and pK(a)] was studied for a series of tetrahydropyran compounds. Sixteen compounds ranging in log D((7.4)) 0.1 to 1.8 were administered intravenously to rats, and the pharmacokinetic parameters were determined from blood concentration time ...

2017
Bangrui Chen Peter I. Frazier

We consider online content recommendation with implicit feedback through pairwise comparisons, formalized as the so-called dueling bandit problem. We study the dueling bandit problem in the Condorcet winner setting, and consider two notions of regret: the more well-studied strong regret, which is 0 only when both arms pulled are the Condorcet winner; and the less well-studied weak regret, which...

Journal: :Electr. Notes Theor. Comput. Sci. 2002
Ángel Herranz-Nieva Juan José Moreno-Navarro N. Maya

The paper presents the re e tion fa ilities of the spe i ation language Slam-sl. Slam-sl is an obje t oriented spei ation language where lass methods are spe i ed by pre and post onditions. The re e tion apabilities permit managing these pre and post onditions in spe i ations what means that semanti re e tion is possible. The range of interesting appli ations is very wide: formal spe i ation of...

2011

1 Introduction From the late 1960s through the early 1980s, the macroeconomy experienced high in‡ation and several recessions. Many attribute this to oil price shocks. Others argue that the persistent high in‡ation may have been due to poorly managed monetary policy. CGG set out to add rigor to this latter argument. CGG estimate a forward-looking interest rate rule before Paul Volker (pre-1979)...

2012
Mario Jovanović Thomas K. Bauer Wolfgang Leininger

During fi nancial crises central banks usually decrease interest rates in order to reduce fi nancial uncertainty. This behavior increases infl ation risk. The trade-off between infl ation and uncertainty stabilization can be modeled by the generalized Taylor rule, which describes infl ation sensitivity as a function of fi nancial uncertainty instead of a constant parameter. Based on the GMM-est...

2008
Markus Jochmann Gary Koop Simon M. Potter

This paper investigates the relationship between short-term and long-term in‡ation expectations using daily data on in‡ation compensation. We use a ‡exible econometric model which allows us to uncover this relationship in a data-based manner. We relate our …ndings to the issue of whether in‡ation expectations are anchored, unmoored or contained. Our empirical results indicate no support for eit...

Journal: :Technique et Science Informatiques 2011
Frédéric Guidec Julien Haillot

RÉSUMÉ Dans le modèle de la ommuni ation dite basée ontenus (CBN: Content-Based Communi ation), l'information est a heminée vers les ré epteurs intéressés, plut t que vers des destinataires identi és. Ce style de ommuni ation répond parfaitement aux besoins des appli ations né essitant une API de ommuni ation de type publish-subs ribe. Dans et artile nous nous intéressons au support de la ommun...

Journal: :Int. J. Comput. Math. 2018
Mojtaba Nouri Bygi Mohammad Ghodsi

In this paper we consider the problem of computing the weak visibility polygon of any query line segment pq (or WVP(pq)) inside a given polygon P . Our first non-trivial algorithm runs in simple polygons and needs O(n log n) time and O(n) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|). We also give an algorithm to compute the weak vi...

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

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