Zobrazeno 1 - 10
of 131
pro vyhledávání: '"Suresh Rai"'
Autor:
Suresh Rai, Satyanarayana K.
Publikováno v:
PLANT ARCHIVES. 22:265-273
Publikováno v:
2010 GSW Proceedings.
Autor:
Heon-Ju Lee, Ulugbek Shaislamov, Suresh Rai, Waqar Ahmed Muhammed, Shirjana Saud, Jong Keun Yang
Publikováno v:
Journal of the Korean Physical Society. 75:644-651
Metallic mirrors are now essential components of the (International Thermonuclear Experiment Reactor) ITER plasma diagnostics system. The optical properties of the first mirror (FM) in the hostile ITER environment have adverse effects due to erosion
Publikováno v:
Computational Geometry. 48:688-702
Given a stream of rectangles over a discrete space, we consider the problem of computing the total number of distinct points covered by the rectangles. This is the discrete version of the two-dimensional Klee's measure problem for streaming inputs. G
Publikováno v:
IEEE Transactions on Reliability. 64:118-131
This paper addresses an NP-hard problem, refered to as Network Topology Design with minimum Cost subject to a Reliability constraint (NTD-CR), to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint
Publikováno v:
IPDPS
We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move (LCM) cycles and communicate with other robots using colored lights (the robots with lights model). We study the fundamental problem of repositioning
Autor:
Suresh Rai, Sinha Rb, Aruna Ambadahalli Siddaiah, Suraj Prsad, Subrat Satpaty, Alok Sahay, Omprakash Dubey, Rajendra Prasad
Publikováno v:
International Journal of Industrial Entomology. 29:135-144
Rearing of tropical tasar silkworm, Antheraea mylitta Drury is mainly conducted in outdoor on Terminalia tomentosa W. & A. a nature grown primary host plant available in forest and also on raised primary host plant Terminalia arjuna Bedd. Temperature
Publikováno v:
IEEE Transactions on Reliability. 63:443-454
This paper addresses an NP-hard problem to design a network topology with maximum all-terminal reliability subject to a cost constraint, given the locations of the various computer centers (nodes), their connecting links, each link's reliability and
Publikováno v:
Journal of Advances in Computer Networks. :286-290
This paper addresses an NP-hard problem, called NTD-CR, to design a minimal-cost communication network topology that satisfies a pre-defined reliability constraint. Since reliability is always a major issue in the network design, the problem is pract
Autor:
Jong-Keun Yang, Heon-Ju Lee, Muhammad Waqar Ahmed, Ulugbek Shaislamov, Natraj Premkumar, Chang-Hoon Han, Suresh Rai, Meejung Ahn, Sangjae So
Publikováno v:
Journal of Physics D: Applied Physics. 52:215401