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

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

2015
Bhupinder Kaur Vaibhav Pandey

Last decade has witnessed wide growth of Mobile ad-hoc networks (MANETs). Mobile ad-hoc network is self-configurable and adaptive. MANETs use wireless connections to connect various networks. There are number of issues and challenges in a mobile ad hoc network. Due to many number of nodes transmitting packets over the network, the chances of losing the packets over the network increases to a gr...

Journal: :ACM SIGCOMM Computer Communication Review 2015

Journal: :SIAM Journal on Applied Mathematics 2003

Journal: :Case Reports in Ophthalmology 2019

Journal: :National Tax Journal 1991

Journal: :nternational journal of communication networks and information security 2022

Transport is one of the key elements in development any country; it can be a powerful catalyst for economic growth. However, infrastructure does not give enough to huge number vehicles which produces several problems, particularly terms road safety, and loss time pollution. One most significant problems congestion, this major handicap transport system. An alternative would use new technologies ...

Journal: :IACR Cryptology ePrint Archive 2008
Subhamoy Maitra Santanu Sarkar

In this paper we revisit Wiener’s method (IEEE-IT 1990) of continued fraction (CF) to find new weaknesses in RSA. We consider RSA with N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. Our motivation is to find out when RSA is insecure given d is O(N), where we are mostly interested in the range 0.3 ≤ δ ≤ 0.5. Given ρ (1 ≤ ρ ≤ 2) is known to the attacker, we sh...

Journal: :J. Symb. Log. 2008
John R. Steel

This complements the work of [2] on the construction of scales of minimal complexity on sets of reals in K(R). Theorem 0.1 was proved there under the stronger hypothesis that all sets definable over M are determined, although without the capturing hypothesis. (See [2, Theorem 4.14].) Unfortunately, this is more determinacy than would be available as an induction hypothesis in a core model induc...

1991
Mark Ryan

Starting from a logic which speciies how to make deductions from a set of sentences (a ``at theory'), a way to generalise this to a partially ordered bag of sentences (a `structured theory') is given. The partial order is used to resolve connicts. If occurs below then is accepted only insofar as it does not connict with. We start with a language L, a set of interpretations M and a satisfaction ...

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

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