English
Related papers

Related papers: Performance Analysis of Estimation of Distribution…

200 papers

In this paper, Estimation of Distribution Algorithm (EDA) is used for Zone Routing Protocol (ZRP) in Mobile Ad-hoc Network instead of Genetic Algorithm (GA). It is an evolutionary approach, it is used when the network size grows and the…

Networking and Internet Architecture · Computer Science 2011-12-15 Md. Imran Hossain , Md. Iqbal Hossain Suvo

Estimation of distribution algorithms (EDA) are stochastic optimization algorithms. EDA establishes a probability model to describe the distribution of solution from the perspective of population macroscopically by statistical learning…

Neural and Evolutionary Computing · Computer Science 2020-03-19 Zhenyu Liang , Yunfan Li , Zhongwei Wan

Routing is the main part of wireless adhoc network conventionally there are two approaches first one is Proactive and another one is Reactive. Both these approaches have some substantial disadvantage and to overcome hybrid routing protocols…

Networking and Internet Architecture · Computer Science 2010-12-14 Kamaljit I. Lakhtaria

As a typical model-based evolutionary algorithm (EA), estimation of distribution algorithm (EDA) possesses unique characteristics and has been widely applied to global optimization. However, the common-used Gaussian EDA (GEDA) usually…

Neural and Evolutionary Computing · Computer Science 2018-08-01 Yongsheng Liang , Zhigang Ren , Xianghua Yao , Zuren Feng , An Chen

Mobile ad hoc networking (MANET) is a growing technology that can support the operation of adaptive wireless networks. With the increased demand rate of wireless applications it is useful to have more adaptive and self organizing…

Networking and Internet Architecture · Computer Science 2014-10-20 Biju Issac , Khairuddhin Ab Hamid , C. E. Tan

Tensor networks are a tool first employed in the context of many-body quantum physics that now have a wide range of uses across the computational sciences, from numerical methods to machine learning. Methods integrating tensor networks into…

Machine Learning · Computer Science 2026-04-27 John Gardiner , Javier Lopez-Piqueres

Delay and Disruption Tolerant Networks (DTNs) may lack continuous network connectivity. Routing in DTNs is thus a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the…

Networking and Internet Architecture · Computer Science 2017-06-23 Lei You , Jianbo Li , Changjiang We , Chenqu Dai

Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Generative Adversarial Networks (GAN) are generative neural networks which can be trained to implicitly model the…

Neural and Evolutionary Computing · Computer Science 2016-08-09 Malte Probst

In the past decade, significant research has been carried out for realizing intelligent network routing using advertisement, position and near-optimum node selection schemes. In this paper, a grade-based two-level node selection method…

Networking and Internet Architecture · Computer Science 2012-04-02 T. R. Gopalakrishnan Nair , Kavitha Sooda

Multi-mode resource-constrained project scheduling problems (MRCPSPs) are classified as NP-hard problems, in which a task has different execution modes characterized by different resource requirements. Estimation of distribution algorithm…

Other Computer Science · Computer Science 2014-02-25 Omar S. Soliman , Elshimaa A. R. Elgendi

Efficiency and simplicity of random algorithms have made them a lucrative alternative for solving complex problems in the domain of communication networks. This paper presents a random algorithm for handling the routing problem in Mobile Ad…

Distributed, Parallel, and Cluster Computing · Computer Science 2010-07-15 N. Ch. Sriman Narayana Iyengar , Syed Mohammad Ansar Sachin kumar , Piyush Nagar , Siddharth Sharma , Akshay Atrey

This paper addresses the path selection problem from a known source to the destination in dense networks. The proposed solution for route discovery uses the genetic algorithm approach for a QoS based network. The multi point crossover and…

Networking and Internet Architecture · Computer Science 2014-08-11 T R Gopalakrishnan Nair , Kavitha Sooda , R Selvarani

Maximizing network lifetime is a very challenging issue in routing protocol design for Mobile Ad-hoc NETworks (MANETs), since mobile nodes are powered by limited-capacity batteries. Furthermore, replacing or recharging batteries is often…

Networking and Internet Architecture · Computer Science 2009-04-16 Saloua Chettibi

This paper proposes two distributed random reshuffling methods, namely Gradient Tracking with Random Reshuffling (GT-RR) and Exact Diffusion with Random Reshuffling (ED-RR), to solve the distributed optimization problem over a connected…

Optimization and Control · Mathematics 2025-03-18 Kun Huang , Linli Zhou , Shi Pu

In Internet Routing, the static shortest path (SP) problem has been addressed using well known intelligent optimization techniques like artificial neural networks, genetic algorithms (GAs) and particle swarm optimization. Advancement in…

Neural and Evolutionary Computing · Computer Science 2011-07-12 T. R. Gopalakrishnan Nair , Kavitha Sooda , M. B. Yashoda

A new adopted evolutionary algorithm is presented in this paper to solve the non-smooth, non-convex and non-linear multi-area economic dispatch (MAED). MAED includes some areas which contains its own power generation and loads. By…

Other Computer Science · Computer Science 2018-06-18 Mina Yazdandoost , Peyman Khazaei , Salar Saadatian , Rahim Kamali

Routing plays a fundamental role in network applications, but it is especially challenging in Delay Tolerant Networks (DTNs). These are a kind of mobile ad hoc networks made of e.g. (possibly, unmanned) vehicles and humans where, despite a…

Networking and Internet Architecture · Computer Science 2021-05-21 Michela Lorandi , Leonardo Lucio Custode , Giovanni Iacca

A mobile Ad-hoc network (MANET) is a dynamic multi hop wireless network established by a group of nodes in which there is no central administration. Due to mobility of nodes and dynamic network topology, the routing is one of the most…

Networking and Internet Architecture · Computer Science 2011-12-30 Kavita Pandey , Abhishek Swaroop

We propose a general formulation of a univariate estimation-of-distribution algorithm (EDA). It naturally incorporates the three classic univariate EDAs \emph{compact genetic algorithm}, \emph{univariate marginal distribution algorithm} and…

Neural and Evolutionary Computing · Computer Science 2022-10-07 Benjamin Doerr , Marc Dufay

Estimation-of-distribution algorithms (EDAs) are general metaheuristics used in optimization that represent a more recent alternative to classical approaches like evolutionary algorithms. In a nutshell, EDAs typically do not directly evolve…

Neural and Evolutionary Computing · Computer Science 2018-06-15 Martin S. Krejca , Carsten Witt
‹ Prev 1 2 3 10 Next ›