Search results for "routing"

Iterative approximation to a coincidence point of two mappings

2015

In this article two methods for approximating the coincidence point of two mappings are studied and moreover, rates of convergence for both methods are given. These results are illustrated by several examples, in particular we apply such results to study the convergence and their rate of convergence of these methods to the solution of a nonlinear integral equation and of a nonlinear differential equation.

On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets

2000

We investigate the computational properties of finite binary- and analog-state discrete-time symmetric Hopfield nets. For binary networks, we obtain a simulation of convergent asymmetric networks by symmetric networks with only a linear increase in network size and computation time. Then we analyze the convergence time of Hopfield nets in terms of the length of their bit representations. Here we construct an analog symmetric network whose convergence time exceeds the convergence time of any binary Hopfield net with the same representation length. Further, we prove that the MIN ENERGY problem for analog Hopfield nets is NP-hard and provide a polynomial time approximation algorithm for this p…

Optimal nonlinear damping control of second-order systems

2020

Novel nonlinear damping control is proposed for the second-order systems. The proportional output feedback is combined with the damping term which is quadratic to the output derivative and inverse to the set-point distance. The global stability, passivity property, and convergence time and accuracy are demonstrated. Also the control saturation case is explicitly analyzed. The suggested nonlinear damping is denoted as optimal since requiring no design additional parameters and ensuring a fast convergence, without transient overshoots for a non-saturated and one transient overshoot for a saturated control configuration.

Learning Automata-based Misinformation Mitigation via Hawkes Processes

2021

AbstractMitigating misinformation on social media is an unresolved challenge, particularly because of the complexity of information dissemination. To this end, Multivariate Hawkes Processes (MHP) have become a fundamental tool because they model social network dynamics, which facilitates execution and evaluation of mitigation policies. In this paper, we propose a novel light-weight intervention-based misinformation mitigation framework using decentralized Learning Automata (LA) to control the MHP. Each automaton is associated with a single user and learns to what degree that user should be involved in the mitigation strategy by interacting with a corresponding MHP, and performing a joint ra…

Routing electric vehicles with a single recharge per route

2020

Networks : an international journal (2020). doi:10.1002/net.21964

Synthetic Genes for artificial ants. Diversity in ant colony optimization algorithms

2010

Inspired from the fact that the real world ants from within a colony are not clones (although they may look alike, they are different from one another), in this paper, the authors are presenting an adapted ant colony optimisation (ACO) algorithm that incorporates methods and ideas from genetic algorithms (GA). Following the first (introductory) section of the paper is presented the history and the state of the art, beginning with the stigmergy and genetic concepts and ending with the latest ACO algorithm variants as multiagent systems (MAS). The rationale and the approach sections are aiming at presenting the problems with current stigmergy-based algorithms and at proposing a (possible - ye…

Preface: Special issue on arc routing problems and other related topics

2020

Methodology for Structured Data-Path Implementation in VLSI Physical Design: A Case Study

2022

State-of-the-art modern microprocessor and domain-specific accelerator designs are dominated by data-paths composed of regular structures, also known as bit-slices. Random logic placement and routing techniques may not result in an optimal layout for these data-path-dominated designs. As a result, implementation tools such as Cadence’s Innovus include a Structured Data-Path (SDP) feature that allows data-path placement to be completely customized by constraining the placement engine. A relative placement file is used to provide these constraints to the tool. However, the tool neither extracts nor automatically places the regular data-path structures. In other words, the relative placement f…

Implementation of algorithms forK shortest loopless paths

1986

Implementations of loopless k shortest path algorithms are examined. Efficient storage structures for a large number of paths are given. A fast algorithm for determining the shortest paths in Yen's method is developed. Timing experiments show that a hybrid of Clarke's and Yen's methods is generally the fastest, although not significantly. Using upper bounds for the lengths of paths essentially improves all methods.

Performance of power control in inter-cell interference coordination for frequency reuse

2010

To mitigate inter-cell interference in 3G evolution systems, a novel inter-cell interference coordination scheme called soft fractional frequency reuse is proposed in this article, which enables to improve the data rate in cell-edge. On this basis, an inter-cell power control is presented for the inter-cell interference coordination, and the inter-cell balanced signal to interference plus noise ratio (SINR) among users is established for power allocation, which enables mitigation of inter-cell interference. Especially, the power control is based on a novel exponential kernel equation at higher convergence speed than the traditional arithmetic kernel equations. Numerical results show that th…