نتایج جستجو برای: barely

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

Journal: :مرتع و آبخیزداری 0
شفق رستگار دانش آموختة دکتری مرتعداری، دانشکدة مرتع و آبخیزداری، دانشگاه علوم کشاورزی و منابع طبیعی گرگان علی دریجانی استادیار دانشکدة اقتصاد کشاورزی، دانشگاه علوم کشاورزی و منابع طبیعی گرگان حسین بارانی دانشیار دانشکدة مرتع و آبخیزداری، دانشگاه علوم کشاورزی و منابع طبیعی گرگان محمد قربانی استاد دانشکدة اقتصاد کشاورزی، دانشگاه فردوسی جمشید قربانی استادیار دانشکدة مرتع و آبخیزداری، دانشگاه علوم کشاورزی و منابع طبیعی ساری واحد بردی شیخ دانشیار دانشکدة مرتع و آبخیزداری، دانشگاه علوم کشاورزی و منابع طبیعی گرگان

forage is the main product of rangelands. so, determining its economic value as one of the main important nonmonetary functions can help managers to improve planning and optimal utilization management of rangelands. the main purpose of this study is to estimate the economic valuation of the forage of summer rangelands in nour-roud watershed basin in mazandaran province. consequently, total fora...

Journal: :Journal of the London Mathematical Society 2000

2006
Ian Hodkinson

We study a canonical modal logic introduced by Lemmon, and axiomatised by an infinite sequence of axioms generalising McKinsey’s formula. We prove that the class of all frames for this logic is not closed under elementary equivalence, and so is non-elementary. We also show that any axiomatisation of the logic involves infinitely many non-canonical formulas. MSC2000: 03B45.

Journal: :RAIRO - Theor. Inf. and Applic. 2011
Dennis Komm Richard Královic

Recently, a new measurement – the advice complexity – was introduced for measuring the information content of online problems. The aim is to measure the bitwise information that online algorithms lack, causing them to perform worse than offline algorithms. Among a large number of problems, a well-known scheduling problem, job shop scheduling with unit length tasks, and the paging problem were a...

Journal: :Combinatorics, Probability and Computing 2014

Journal: :Combinatorics, Probability & Computing 2014
Shankar Bhamidi Amarjit Budhiraja Xuan Wang

Bounded-size rules(BSR) are dynamic random graph processes which incorporate limited choice along with randomness in the evolution of the system. Typically one starts with the empty graph and at each stage two edges are chosen uniformly at random. One of the two edges is then placed into the system according to a decision rule based on the sizes of the components containing the four vertices. F...

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

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