Let S be a set of n points in < d. We present an algorithm that uses the well-separated pair decomposition and computes the minimum spanning tree of S under any Lp or polyhedral metric. It has an expected running time of O(n logn) for uniform distributions. Experimentalresults show that this approachis practical. Under a variety of input distributions, the resultingimplementation is robust and ...

We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in < d. We show how this leads to a deterministic optimal O(logn) time parallel algorithm for nding the k-nearest-neighbors of each point in P, where k is a constant. We discuss several additional applications of the well-separated pair decomposition for which we can derive faster parall...

Let S be a set of points in R. Given a geometric spanner graph, G = (S, E), with constant dilation t, and a positive constant ε, we show how to construct a (1 + ε)-spanner of G with O(|S|) edges in time O(|E|+ |S| log |S|). Previous algorithms require a preliminary step in which the edges are sorted in non-decreasing order of their lengths and, thus, have running time Ω(|E| log |S|). We obtain ...

Creating software-controlled agents in videogames who can learn and adapt to player behavior is a difficult task. Using the real-time NeuroEvolution of Augmenting Topologies (rtNEAT) method for evolving increasingly complex artificial neural networks in real-time has been shown to be an effective way of achieving behaviors beyond simple scripted character behavior. In NERO, a videogame built to...

This paper contributes to the expanding literature on soft topology. We first prove that topologies can be characterized by crisp topologies. takes advantage of two connected constructions produce from and vice versa. Both are explicit amenable mathematical manipulations. Various consequences demonstrate our theory has far-reaching implications for development topology its extensions.

In this article we describe EANT2, Evolutionary Acquisition of Neural Topologies, Version 2, a method that creates neural networks by evolutionary reinforcement learning. The structure of the networks is developed using mutation operators, starting from a minimal structure. Their parameters are optimised using CMA-ES, Covariance Matrix Adaptation Evolution Strategy, a derandomised variant of ev...

This paper examines several existing voltage equalizers techniques for energy storage system, with a focusing on batteries and supercapacitors. Due satisfy the demands, cells are often coupled in series/parallel. However, divergence of distributed among produces problems imbalance that affecting ageing system solved through equalizers. Several assessments from features topologies balancing circ...

1.1 HARMONICS IN ELECTRICAL SYSTEMS ............................................................................................ 1 1.2 CONVENTIONAL TWO-LEVEL AND THREE-LEVEL VOLTAGE SOURCE INVERTER ............................... 2 1.3 MULTILEVEL VOLTAGE SOURCE INVERTER..................................................................................... 5 1.3.1 Diode-Clamped Multilevel Inverter...

Given the positions of n sites in a radio network we consider the problem of finding routes between any pair of sites that minimize energy consumption and do not use more than some constant number k of hops. Known exact algorithms for this problem required Ω(n logn) per query pair (p, q). In this paper we relax the exactness requirement and only compute approximate (1+2) solutions which allows ...