نتایج جستجو برای: strict congestion

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

Journal: :J. Symb. Log. 1946
Ruth C. Barcan

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

A.A. Nouraa E. Hosseini

the method for measuring the congestion of Noura et al. [A.A. Noura, F. ‎Hosseinzadeh Lotfi, G.R. Jahanshahloo, S. ‎Fanati Rashidi, R.P. Barnett, A new method for measuring congestion in data envelopment analysis, Socio-Economic Planning Sciences, 44 (2010) 240-246] ,there is no problem for congestion detection In the case of one input and one output but in higher space is not able to detect co...

2016
Toby Friend

The ubiquitous schema ‘All Fs are Gs’ dominates much philosophical discussion on laws but rarely is it shown how actual laws mentioned and used in science are supposed to fit it. After consideration of a variety of laws, including those obviously conditional and those superficially not conditional (such as equations), I argue that we have good reason to support the traditional interpretation of...

Journal: :Comput. Lang. 2000
Guy Tremblay

What is a non-strict functional language? Is a non-strict language necessarily lazy? What additional expressiveness brings non-strictness, with or without laziness? This paper tries to shed some light on these questions. First, in order to characterize non-strictness, di1erent evaluation strategies are introduced: strict, lazy, and lenient. Then, using program examples, how these evaluation str...

Journal: :Comput. J. 1989
Stuart Wray Jon Fairbairn

Non-strict evaluation improves the expressive power of functional languages at the expense of an apparent loss of eeciency. In this paper we give examples of this expressive power, taking as an example an interactive functional program and describing the programming techniques depending on non-strict evaluation which improved its design. Implementation methods for non-strict languages have deli...

Journal: :international journal of information science and management 0
a. ezil sam leni m.s. , research scholar sathyabama deemed university s. k. srivatsa srivatsa, ph.d. , m.i.t- chennai university

as wireless networks with high data rate get widely deployed, improving the performance of tcp over these networks plays vital role. wireless link losses have dramatic adverse impact on tcp performance due to the difficulty in distinguishing the congestion losses from wireless link losses. we first, studied the various existing bandwidth estimation algorithms over the wireless networks. in this...

2002
Takuya Okamoto Tatsuhiko Terai Go Hasegawa Masayuki Murata

Although many research efforts have been devoted to the network congestion against an increase of the Internet traffic, there has been a little concern on improvement of the performance of Internet hosts in spite of the projection that the bottleneck is now being shifted from the network to hosts. We have proposed SSBT (Scalable Socket Buffer Tuning), which is intended to improve the performanc...

Journal: :J. Global Optimization 2010
Tuomo Valkonen

We provide a necessary and sufficient condition for strict local minimisers of differences of convex (DC) functions, as well as related results pertaining to characterisation of (non-strict) local minimisers, and uniqueness of global minimisers.

2010
Gert-Jan C. Lokhorst

In 1926, Ernst Mally proposed the first system of deontic logic. His system turned out to be unacceptable. How can it be repaired? We discuss several proposals to reformulate it in terms of strict implication, relevant implication and strict relevant implication.

2007
Carlo A. Furia Matteo Rossi

The untilmodality of temporal logic “A until B” is called strict in its first argument when it does not constrain the value of the first argument A at the instant at which the formula is evaluated. In this paper, we show that linear metric temporal logics with bounded until modalities that are non-strict in the first argument are as expressive as those with strict modalities, when interpreted o...

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

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