Loading...
Search for: efficient-method
0.007 seconds
Total 24 records

    Efficient and safe path planning for a mobile robot using genetic algorithm

    , Article 2009 IEEE Congress on Evolutionary Computation, CEC 2009, Trondheim, 18 May 2009 through 21 May 2009 ; 2009 , Pages 2091-2097 ; 9781424429592 (ISBN) Naderan Tahan, M ; Manzuri Shalmani, T ; Sharif University of Technology
    2009
    Abstract
    In this paper, a new method for path planning is proposed using a genetic algorithm (GA). Our method has two key advantages over existing GA methods. The first is a novel environment representation which allows a more efficient method for obstacles dilation in comparison to current cell based approaches that have a tradeoff between speed and accuracy. The second is the strategy we use to generate the initial population in order to speed up the convergence rate which is completely novel. Simulation results show that our method can find a near optimal path faster than computational geometry approaches and with more accuracy in smaller number of generations than GA methods. © 2009 IEEE  

    Towards an efficient method for spreading information in social network

    , Article 2009 3rd Asia International Conference on Modelling and Simulation, AMS 2009, Bandung, Bali, 25 May 2009 through 26 May 2009 ; 2009 , Pages 152-157 ; 9780769536484 (ISBN) Ahmadi, H ; Mehrbakhsh, A ; Asgarian, E ; Sharif University of Technology
    2009
    Abstract
    Nowadays, content distribution is of high attention in peer to peer information systems. There are two main problems that could be mentioned in this context. The first problem is how to disseminate fragments of information efficiently and the next is to avoid missing same rare fragments towards end of download. For overcoming these problems, a new mechanism is presented in this paper which uses gossip algorithms on basis of social networks. Our mechanism maintains simplicity of gossip and has low overhead. This mechanism includes two phases for managing traffic and solving bottleneck problem: one for spreading rumors inside the social network and finding network of interests and the other... 

    Efficient method for simplifying and approximating the S-boxes based on power functions

    , Article IET Information Security ; Volume 3, Issue 3 , 2009 , Pages 114-118 ; 17518709 (ISSN) Farhadian, A ; Aref, M. R ; Sharif University of Technology
    2009
    Abstract
    In recently proposed cipher algorithms, power functions over finite fields and specially inversion functions play an important role in the S-box design structure. In this study, a new systematic efficient method is introduced to cryptanalyse (to simplify and approximate) such S-boxes. This method is very simple and does not need any heuristic attempt and can be considered as a quick criterion to find some simple approximations. Using this new method, some approximations can be obtained for advanced encryption standard (AES) like S-boxes, such as AES, Camellia, Shark and so on. Finally as an application of this method, a simple linear approximation for AES S-box is presented. © The... 

    Tolerance–reliability analysis of mechanical assemblies for quality control based on Bayesian modeling

    , Article Assembly Automation ; Volume 39, Issue 5 , 2019 , Pages 769-782 ; 01445154 (ISSN) Khodaygan, S ; Ghaderi, A ; Sharif University of Technology
    Emerald Group Publishing Ltd  2019
    Abstract
    Purpose: The purpose of this paper is to present a new efficient method for the tolerance–reliability analysis and quality control of complex nonlinear assemblies where explicit assembly functions are difficult or impossible to extract based on Bayesian modeling. Design/methodology/approach: In the proposed method, first, tolerances are modelled as the random uncertain variables. Then, based on the assembly data, the explicit assembly function can be expressed by the Bayesian model in terms of manufacturing and assembly tolerances. According to the obtained assembly tolerance, reliability of the mechanical assembly to meet the assembly requirement can be estimated by a proper first-order...