نتایج جستجو برای: gravitational research algorithm

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

Journal: :Lecture Notes on Software Engineering 2013

Journal: :journal of advances in computer research 0
touraj mohammadpour department of computer engineering, ayatollah amoli branch, islamic azad university, amol, iran mehdi yadollahi department of computer engineering, ayatollah amoli branch, islamic azad university, amol, iran amir massoud bidgoli assistant professor, b.sc., m.sc., ph.d. (manchester university), mieee, tehran north branch, islamic azad university, tehran, iran habib esmaeelzadeh rostam department of computer engineering, ghaemshahr branch, islamic azad university, ghaemshahr, iran

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...

2010
S. Raja Balachandar

A new Meta heuristic approach called ”Randomized gravitational emulation search algorithm (RGES)” for solving vertex covering problems has been designed. This algorithm is found upon introducing randomization concept along with the two of the four primary parameters ’velocity’ and ’gravity’ in physics. A new heuristic operator is introduced in the domain of RGES to maintain feasibility specific...

2012
S. Raja Balachandar

A new Meta heuristic approach called ”Randomized gravitational emulation search algorithm (RGES)” for solving large size set covering problems has been designed. This algorithm is found upon introducing randomization concept along with the two of the four primary parameters ’velocity’ and ’gravity’ in physics. A new heuristic operator is introduced in the domain of RGES to maintain feasibility ...

Journal: :Algorithms 2017
Danilo Pelusi Raffaele Mascella Luca G. Tallini

The choice of the best optimization algorithm is a hard issue, and it sometime depends on specific problem. The Gravitational Search Algorithm (GSA) is a search algorithm based on the law of gravity, which states that each particle attracts every other particle with a force called gravitational force. Some revised versions of GSA have been proposed by using intelligent techniques. This work pro...

2008
V. Dorofeev

Conformal connection of scalar field is shown to produce possible non-metricity in affine connection spaces. In case of self-consistent solution the non-metricity is a correction to background Riemannian structure with respect to gravitational constant and its magnitude may be essential in the early Universe.

Journal: :فیزیک زمین و فضا 0
عبدالرضا صفری استادیار، گروه مهندسی نقشه برداری، پردیس دانشکده های فنی، دانشگاه تهران، ایران محمدعلی شریفی استادیار، گروه مهندسی نقشه برداری، پردیس دانشکده های فنی، دانشگاه تهران، ایران بابک امجدی پرور دانشجوی کارشناسی ارشد ژئودزی، گروه مهندسی نقشه برداری، پردیس دانشکده های فنی، دانشگاه تهران، ایران

the grace mission has substantiated the low–low satellite-to-satellite tracking (ll-sst) concept. the ll-sst configuration can be combined with the previously realized high–low sst concept in the champ mission to provide a much higher accuracy. the line of sight (los) acceleration difference between the grace satellite pair is the most frequently used observable for mapping the global gravity f...

2017
Sudesh Sharma Sarvesh Kumar

In Cloud Computing, VM placement is a critical issue which results in most beneficial levels including economical status. The task is to allocate the given VM to its best fit PM. Number of research oriented approaches are formulated for scheduling VM to appropriate PM. In this paper the author used Discrete Gravitational Search Algorithm for effective VM placement in the given host effectively....

2014
Jonatan Gómez Elizabeth León Guzman

Circular data, i.e., data in the form of 'natural' directions or angles are very common in a number of di erent areas such as biological, meteorological, geological, and political sciences. Clustering circular data is not an easy task due to the circular geometry of the data space. Some clustering approaches, such as the spherical k-means, use the cosine distance instead of the euclidean distan...

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

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