Abstract—This paper introduces a novel parameter automation strategy for the particle swarm algorithm and two further extensions to improve its performance after a predefined number of generations. Initially, to efficiently control the local search and convergence to the global optimum solution

Abstract—This paper describes an integrated network-on-chip architecture containing 80 tiles arranged as an 8 10 2-D array of floating-point cores and packet-switched routers, both designed to operate at 4 GHz. Each tile has two pipelined single-precision floating-point multiply accumulators (FPMAC

Abstract. We construct a continuum model for the motion of biological organisms experiencing social interactions and study its pattern-forming behavior. The model takes the form of a conservation law in two spatial dimensions. The social interactions are modeled in the velocity term, which

. In just one decade, the 1990s, supercomputer centers have undergone two fundamental transitions which require rethinking their operation and their role in high performance computing. The first transition in the early to mid-1990s resulted from a technology change in high performance computing

The authors develop a model for the parallel performance of algorithms that consist of concurrent, two-dimensional wavefronts implemented in a message-passing environment. The model, based on a LogGP machine parameterization, combines the separate contributions of computation and communication

In this paper, we present a time-discrete, incremental methodology for modeling, at the microscopic and macroscopic level, the dynamics of distributed manipulation experiments using swarms of autonomous robots endowed with reactive controllers. The methodology is well-suited for nonspatial metrics

Workers of the Argentine ant, Iridomyrmex humilis, start to explore a chemically unmarked territory randomly. As the exploratory front advances, other explorers are recruited and a trail extends from it to the nest. Whereas recruitment trails are generally constructed between two points

In this paper the authors propose a method for adapting the particle swarm optimizer for dynamic environments. The process consists of causing each particle to reset its record of its best position as the environment changes, to avoid making direction and velocity decisions on the basis of outdated

. QCDOC uses a six-dimensional, low-latency mesh network to connect processing nodes, each of which includes a single custom ASIC, designed by our collaboration and built by IBM, plus DDR SDRAM. Each node has a peak speed of 1 Gigaflops and two 12,288 node, 10+ Teraflops machines are to be completed

Two novel particle swarm optimization (PSO) algorithms are used to track and optimize a 3-dimensional parabolic benchmark function where the optimum location changes randomly and with high severity. The new algorithms are based on an analogy of electrostatic energy with charged particles