• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,870
Next 10 →

Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients

by Asanga Ratnaweera, Saman K. Halgamuge, Harry C. Watson - IEEE Transactions on Evolutionary Computation , 2004
"... 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, tim ..."
Abstract - Cited by 194 (2 self) - Add to MetaCart
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

An 80-tile sub-100-w teraflops processor in 65-nm cmos

by Sriram R. Vangal, Jason Howard, Gregory Ruhl, Saurabh Dighe, Howard Wilson, James Tschanz, David Finan, Arvind Singh, Tiju Jacob, Nitin Borkar, Shekhar Borkar
"... 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 - Cited by 78 (0 self) - Add to MetaCart
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

Swarming patterns in a two-dimensional kinematic model for biological groups

by Chad M. Topaz, Andrea, L. Bertozzi - SIAM J. Appl. Math , 2004
"... 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 is nonloc ..."
Abstract - Cited by 118 (15 self) - Add to MetaCart
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

Building the Teraflops/Petabytes Production Supercomputing Center

by Horst D. Simon, William T. C. Kramer, Robert F. Lucas - In Fifth International Euro-Par Conference Proceeding , 1999
"... . 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 a ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
. 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

Performance and Scalability Analysis of Teraflop-Scale Parallel Architectures using Multidimensional Wavefront Applications

by Harvey Wasserman, Adolfy Hoisie, Adolfy Hoisie, Olaf Lubeck, Olaf Lubeck - The International Journal of High Performance Computing Applications , 2000
"... 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 wavef ..."
Abstract - Cited by 67 (11 self) - Add to MetaCart
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

Modeling swarm robotic systems: A case study in collaborative distributed manipulation

by Alcherio Martinoli, Kjerstin Easton, William Agassounon - Int. Journal of Robotics Research , 2004
"... 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 s ..."
Abstract - Cited by 116 (26 self) - Add to MetaCart
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

The Self-Organizing Exploratory Pattern of the Argentine Ant

by J. -l. Deneubourg, S. Aron, S. Goss, J. M. Pasteels L - Insect Behavior , 1990
"... 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, these explo ..."
Abstract - Cited by 176 (5 self) - Add to MetaCart
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

Adapting Particle Swarm Optimization to Dynamic Environments

by Anthony Carlisle, Gerry Dozier - Proceedings, 2000 ICAI, Las Vegas, NV , 2000
"... 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 ..."
Abstract - Cited by 87 (2 self) - Add to MetaCart
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: A 10 Teraflops Computer for Tightly-coupled Calculations

by P. A. Boyle, D. Chen, N. H. Christ, M. Clark, S. D. Cohen, C. Cristian, Z. Dong, A. Gara, B. Joo, C. Jung, C. Kim, L. Levkova, X. Liao, G. Liu, R. D. Mawhinney, S. Ohta, K. Petrov, T. Wettig, A. Yamaguchi , 2004
"... Numerical simulations of the strong nuclear force, known as quantum chromodynamics or QCD, have proven to be a demanding, forefront problem in high-performance computing. In this report, we describe a new computer, QCDOC (QCD On a Chip), designed for optimal price/performance in the study of QCD. QC ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
. 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

Dynamic search with charged swarms

by T. M. Blackwell - in GECCO 2002 , 2002
"... 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. For compar ..."
Abstract - Cited by 48 (5 self) - Add to MetaCart
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
Next 10 →
Results 1 - 10 of 1,870
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University