نتایج جستجو برای: r online
تعداد نتایج: 692397 فیلتر نتایج به سال:
In the online F -avoidance edge-coloring game with r colors, a graph on n vertices is generated by at each stage randomly adding a new edge. The player must color each new edge as it appears; his goal is to avoid a monochromatic copy of F . Let N0(F, r, n) be the threshold function for the number of edges that the player is asymptotically almost surely able to paint before he loses. Even when F...
Significantly Reduced Anisotropic Phonon Thermal Transport in Graphene Oxide Films Wei Yu a b , Guoqing Liu b , Jianmei Wang b c , Xiaopeng Huang b , Huaqing Xie a & Xinwei Wang b a School of Urban Development and Environmental Engineering , Shanghai Second Polytechnic University , Shanghai , P. R. China b Department of Mechanical Engineering , Iowa State University , Ames , Iowa , USA c Colleg...
Address for Correspondence: Dr. Jülide Sayın Kart, Acıbadem Üniversitesi Tıp Fakültesi, Anesteziyoloji ve Reanimasyon Anabilim Dalı, İstanbul, Türkiye Phone: +90 216 544 40 77 E-mail: [email protected] ©Copyright 2015 by Turkish Anaesthesiology and Intensive Care Society Available online at www.jtaics.org Received : 17.11.2014 Accepted : 20.12.2014 Available Online Date : 16.02.2015 Jülid...
Online Bipartite Matching is a generalization of a well-known Bipartite Matching problem. In a Bipartite Matching, we a given a bipartite graph G = (L,R,E), and we need to find a matching M ⊆ E such that no edges in M have common endpoints. In the online version L is known, but vertices in R are arriving one at a time. When vertex j ∈ R arrives (with all its edges), we need to make an irreversi...
1 Online bipartite matching Recall from last time we introduced the online bipartite matching problem and gave an algorithm to solve a fractional version of the problem with competitive ratio 1− 1/e. In the online bipartite matching problem, we are given a bipartite graph G = (L,R,E), where the vertices in R are revealed to us one at a time along with the edges from that vertex to L. Once each ...
This paper investigates the semi-online version of scheduling problemP ||Cmax on a three-machine system.We assume that all jobs have their processing times between p and rp (p> 0, r 1).We give a comprehensive competitive ratio of LS algorithm which is a piecewise function on r 1. It shows that LS is an optimal semi-online algorithm for every r ∈ [1, 1.5], [√3, 2] and [6,+∞).We further present a...
2007;69;1789-1799; originally published online Oct 3, 2007; Neurology R. Robertson, N. Sacktor, V. Valcour and V. E. Wojna Joseph, K. Marder, C. M. Marra, J. C. McArthur, M. Nunn, R. W. Price, L. Pulliam, K. Clifford, P. Cinque, L. G. Epstein, K. Goodkin, M. Gisslen, I. Grant, R. K. Heaton, J. A. Antinori, G. Arendt, J. T. Becker, B. J. Brew, D. A. Byrd, M. Cherner, D. B. Updated research nosol...
This paper presents an extension of the Kaldi automatic speech recognition toolkit to support on-line recognition. The resulting recogniser supports acoustic models trained using state-of-theart acoustic modelling techniques. As the recogniser produces word posterior lattices, it is particularly useful in statistical dialogue systems, which try to exploit uncertainty in the recogniser’s output....
امروزه کمبود منابع طبیعی و نرخ بالای رشد جمعیت، لزوم مدیریت و بهره گیری بهینه و مناسب از منابع باقیمانده در طبیعت را ضروری می سازد. یکی از ابزارهای مدیریت منابع، سیستم اطلاعات مکانی می باشد. این سیستم ها جهت ذخیره سازی، بازیابی، تجزیه و تحلیل و نمایش اطلاعات مکانی بکار می روند. با کمک تکنیک های فتوگرامتری می توان داده های مکانی مورد نیاز سیستم های اطلاعات مکانی با ساختار منحصربفرد را تهیه نمود...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید