نتایج جستجو برای: problem of i

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

Journal: :International Journal of Computer Mathematics 2021

As a follow-up of previous work the authors, this considers uniform global time-renormalization functions for gravitational N-body problem. It improves on estimates radii convergence obtained therein by using completely different technique, both solution to original equations and renormalized ones. The aforementioned technique which new are built upon is known as majorants allows an easy applic...

Journal: :iranian journal of microbiology 0
f firoozeh department of microbiology, faculty of veterinary medicine, university of tehran, tehran, iran. f shahcheraghi department of microbiology and mcrobiology research center pasteur institute, tehran, iran. t zahraei salehi department of microbiology, faculty of veterinary medicine, university of tehran, tehran, iran. v karimi clinical sciences department, avian diseases section, faculty of veterinary medicine, university of tehran, tehran, iran. mm aslani department of microbiology and mcrobiology research center pasteur institute, tehran, iran.

background and objectives : salmonella is one of the leading causes of food-borne diseases. increasing occurrence of antimicrobial resistance, especially multidrug-resistance, in salmonella serovars is a major public health problem worldwide. this study was carried out to detect class i integrons and antibiotic resistance profiles in clinical isolates of salmonella serovars collected from seven...

M. Vasei, R. TavakoliMoghadam,

  In this paper, a single machine sequencing problem is considered in order to find the sequence of jobs minimizing the sum of the maximum earliness and tardiness with idle times (n/1/I/ETmax). Due to the time complexity function, this sequencing problem belongs to a class of NP-hard ones. Thus, a special design of a simulated annealing (SA) method is applied to solve such a hard problem. To co...

Journal: :international journal of industrial engineering and productional research- 0
masoud yaghini iran university of science and technology mohsen momeni iran university of science and technology mohammadreza momeni sarmadi iran university of science and technology

the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

Journal: :Journal of Architecture and Planning (Transactions of AIJ) 2018

Journal: :International Journal of Engineering, Science and Technology 2010

2009
Anil Agrawal Ping Tan Satish Nagarajaiah Jian Zhang

Department of Civil Engineering, The City College of the City University of New York, T-121 Steinman Hall, Convent Avenue at 140th Street, New York, NY 10031, U.S.A. Earthquake Engineering Research and Test Center, Guangzhou University, Guangzhou, Guangdong, China Department of Civil and Environmental Engineering, Rice University, Houston, TX 77005, U.S.A. Department of Mechanical Engineering a...

The theory of derivatives and integrals of fractional in fractional calculus have found enormousapplications in mathematics, physics and engineering so for that reason we need an efficient and accurate computational method for the solution of fractional differential equations. This paper presents a numerical method for solving a class of linear and nonlinear multi-order fractional differential ...

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

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