نتایج جستجو برای: frac tional calculus

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

2004
B. Wood B. R. Tershy M. A. Hermosillo C. J. Donlan J. A. Sanchez B. S. Keitt D. A. Croll G. R. Howald N. Biavaschi

B. S. Keitt, D. A. Croll, G. R. Howald, and N. Biavaschi 1 Grupo de Ecología y Conservación de Islas A. C., Av. Del Puerto #375 interior 30, Frac. Playa Ensenada, Ensenada, Baja California, México. 2 Island Conservation and Ecology Group, University of California Long Marine Lab, Santa Cruz, CA 95060 USA. 3 Island Conservation and Ecology Group – Canada, 1485 Crawford Road, Kelowna, BC V1W3A9 C...

Journal: :bulletin of the iranian mathematical society 2011
a. nayebi

ardy and littlewood conjectured that every large integer $n$ that is not a square is the sum of a prime and a square. they believed that the number $mathcal{r}(n)$ of such representations for $n = p+m^2$ is asymptotically given by begin{equation*} mathcal{r}(n) sim frac{sqrt{n}}{log n}prod_{p=3}^{infty}left(1-frac{1}{p-1}left(frac{n}{p}right)right), end{equation*} where $p$ is a prime, $m$ is a...

Journal: :AJNR. American journal of neuroradiology 1981
A C Wagner

The radiographic appearance of the petrotympanic fissure, through whic h the chorda tympani nerve exits the tympanic cavity, is familiar to radiologists as a normal struc ture, not to be mistaken for a frac ture of the anterior wall of the external auditory canal [1, 2). However, th e rad iographic demonstration of the canaliculus chordae tympan i, the bony canal which transmits the chorda tymp...

Journal: :Tohoku Mathematical Journal 1951

Journal: :Bulletin of the Institute of Mathematics Academia Sinica NEW SERIES 2018

Journal: :Problems of Gathering, Treatment and Transportation of Oil and Oil Products 2019

2017
Morteza Zadimoghaddam

We study the problem of online weighted bipartite matching in which we want to find a maximum weighted matching between two sets of entities, e.g. matching impressions in online media to advertisers. Karp et al. [14] designed the elegant algorithm Ranking with competitive ratio 1−1/e for the unweighted case. Without the commonly accepted Free Disposal assumption, it is easy to show that no comp...

Journal: :CoRR 2017
Vera Traub Jens Vygen

We show that there is a polynomial-time algorithm with approximation guarantee 3 2 + ε for the s-t-path TSP, for any fixed ε > 0. It is well known that Wolsey’s analysis of Christofides’ algorithm also works for the s-t-path TSP with its natural LP relaxation except for the narrow cuts (in which the LP solution has value less than two). A fixed optimum tour has either a single edge in a narrow ...

Journal: :Scientific Notes of Taurida National V.I. Vernadsky University. Series: Economy and Management 2019

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

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