نتایج جستجو برای: inputs and limited resources hence

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

2011
Pattabhi Ramacharyulu

The present paper brings out a mathematical model of Ammensal-enemy both immigrated species pair with limited resources. This model is built by a couple of first order non-linear ordinary differential equations. One and only one equilibrium point of this model is traced and the stability criteria at this equilibrium point are derived. Solutions for the linearized perturbed equations are ascerta...

Journal: :The European respiratory journal 2004
M de Perrot W Weder G A Patterson S Keshavjee

A number of strategies have been advocated to increase the number of lung donors including: 1) improvement in donor resuscitation; 2) better methods of lung preservation; 3) extension of the lung donor selection criteria; 4) development of a living-related lung donor programme; and 5) utilisation of nonheart beating donors. Other strategies such as the split-lung technique and techniques of lun...

Journal: :J. UCS 2002
Jonathan Goldstine Martin Kappes Chandra M. R. Kintala Hing Leung Andreas Malcher Detlef Wotschke

Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of different contexts, our goal here is to provide a survey of these results. Particular emphasis is put on limiting resources (e.g., nondeterminism, ambiguity, lookahead, etc.) for various types of finite state machines, push...

2004
Paolo Laureti Joachim Mathiesen Yi-Cheng Zhang

We analyze different methods of sorting and selecting a set of objects by their intrinsic value, via pairwise comparisons whose outcome is uncertain. After discussing the limits of repeated Round Robins, two new methods are presented: The ran-fil requires no previous knowledge on the set under consideration, yet displaying good performances even in the least favorable case. Themin-entmethod set...

1986
David Mutchler

This paper presents a probabilistic model for studying the question: given n search resources, where in the search tree should they be ezpended? Specifically, a least-cost root-to-leaf path is sought in a random tree. The tree is known to be binary and complete to depth N. Arc costs are independently set either to 1 (with probability p ) or to 0 (with probability l-p ). The cost of a leaf is th...

2006
Slawomir Nowaczyk

In this paper we present our preliminary investigation of rational agents who can learn from their experience. We claim that such agents need to combine at least three attributes – deductive reasoning based on currently possessed knowledge, inductive learning from their history, and awareness of passing time (including the necessity to commit computational resources to tasks which need to be ca...

Journal: :International Journal of Digital Multimedia Broadcasting 2008

M. Abbasi M. Rostamy-Malkhlifeh

Congestion is a wasteful stage of the production process where outputs are reduced due to excessive amount of inputs. There are several approaches in data envelopment analysis (DEA) literatures to treat congestion. The concept of strong and weak congestion first developed by Tone and Sahoo [Tone, K., Sahoo, B.K., 2004. Degree of scale economies and congestion: A unified DEA approach. European J...

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

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