A Greedy Algorithm Approach for Mobile Social Network
نویسندگان
چکیده
منابع مشابه
An Identification Algorithm for Evolutionary Community on Mobile Social Network
In mobile social network, detecting community structure reduces a complexity of the network consisted of large datasets, which is important to manage and understand components of the network. Link Community Detection (LCD) is a method that finds out community structure using similarity between two neighboring edges and partition density. Communities detected by this method can have overlapping ...
متن کاملA Cellular Automaton Based Algorithm for Mobile Sensor Gathering
In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...
متن کاملa new approach to credibility premium for zero-inflated poisson models for panel data
هدف اصلی از این تحقیق به دست آوردن و مقایسه حق بیمه باورمندی در مدل های شمارشی گزارش نشده برای داده های طولی می باشد. در این تحقیق حق بیمه های پبش گویی بر اساس توابع ضرر مربع خطا و نمایی محاسبه شده و با هم مقایسه می شود. تمایل به گرفتن پاداش و جایزه یکی از دلایل مهم برای گزارش ندادن تصادفات می باشد و افراد برای استفاده از تخفیف اغلب از گزارش تصادفات با هزینه پائین خودداری می کنند، در این تحقیق ...
15 صفحه اولA genetic algorithm approach for problem
In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i j, the duration of this set-up being the sequ...
متن کاملProgressive Feature Extraction with a Greedy Network-growing Algorithm
In this paper, a new information theoretic method called the greedy network-growing algorithm is proposed. The method is called “greedy,” because a network with this algorithm grows while absorbing as much information as possible from outside. The method is based upon information theoretic competitive learning and can solve the fundamental problems inherent in competitive learning, such as the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/19619-1139