نتایج جستجو برای: petty and kao
تعداد نتایج: 16829304 فیلتر نتایج به سال:
We present a complete proof for the invariant optimal assignment for consecutive-k-outof-(2k+1):G cycle, which was proposed by Zuo and Kao in 1990 with an incomplete proof, pointed out recently by Jalali, Hawkes, Cui and Hwang.
Let mcm(m,n) and mwm(m,n,N) be the complexities of computing a maximum cardinality matching and a maximum weight matching, and let mcmbi,mwmbi be their counterparts for bipartite graphs, where m,n, and N are the edge count, vertex count, and maximum integer edge weight. Kao, Lam, Sung, and Ting [1] gave a general reduction showing mwmbi(m,n,N) = O(N ·mcmbi(m,n)) and Huang and Kavitha [2] recent...
This paper develops a game-theoretic model of petty corruptionby government o¢ cials. Such corruption is widespread, especially (but not only) in developing and transition economies. The model goes beyond the previously published studies in the way it describes the structure of bureaucratic tracks,and the information among the participants. Entrepreneurs apply, in sequence, to a track of ...
Danas je dobro poznata činjenica da je oralno zdravlje važno kao i opće zdravlje organizma (1). U skladu s tim i jedno i drugo zdravlje ovise o dinamičkoj interakciji mnogo čimbenika, kao što su osobne karakteristike, stajališta i percepcije (2). S druge strane, stajalište i odnos prema oralnom zdravlju ovise o utjecaju roditelja na dijete u djetinjstvu i utječu na budući status zdravlja usne š...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید