نتایج جستجو برای: heuristic algorithms

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

Journal: :International Journal of Recent Contributions from Engineering, Science & IT (iJES) 2013

Journal: :Algorithms for Molecular Biology 2021

Abstract Background Best match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics as representation the pairwise most closely related genes among multiple species. An arc connects gene x with y from another species (vertex color) Y whenever it is one phylogenetically closest relatives . BMGs can be approximated help similarity measures between sequ...

Journal: :international journal of automotive engineering 0
fathian jafarian-moghaddam yaghini

vehicular ad-hoc network (vanet) is an important component of intelligent transportation systems, in which vehicles are equipped with on-board computing and communication devices which enable vehicle-to-vehicle communication. consequently, with regard to larger communication due to the greater number of vehicles, stability of connectivity would be a challenging problem. clustering technique as ...

Journal: :IEEE Microwave and Wireless Components Letters 2007

Journal: :Technological and Economic Development of Economy 2006

Journal: :EMAJ: Emerging Markets Journal 2014

Journal: :International Journal of Computer Applications 2013

Journal: :Lecture Notes in Computer Science 2022

Heuristic algorithms are able to optimize objective functions efficiently because they use intelligently the information about functions. Thus, utilization is critical performance of heuristics. However, concept has remained vague and abstract there no reliable metric reflect extent which function utilized by heuristic algorithms. In this paper, ratio (IUR) defined, quantity over acquired in se...

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

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