Skip to search formSkip to main contentSkip to account menu

EPCC

Known as: EPCC (disambiguation), Edinburgh Parallel Computing Centre 
EPCC, formerly the Edinburgh Parallel Computing Centre, is a supercomputing centre based at the University of Edinburgh. Since its foundation in 1990… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
ASCI Blue PacificBlue GeneConnection MachineCray T3D

Broader (1)

Computational science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Why does the environmental influence on group and cluster galaxies extend beyond the virial radius
In the local Universe, galaxies in groups and clusters contain less gas and are less likely to be forming stars than their field… 
Highly Cited
2011
Highly Cited
2011
A.I.K.E.F.: Adaptive hybrid model for space plasma simulations
Highly Cited
2011
Highly Cited
2011
Global structure and kinematics of stellar haloes in cosmological hydrodynamic simulations
We use the Galaxies–Intergalactic Medium Interaction Calculation (GIMIC) suite of cosmological hydrodynamical simulations to… 
Highly Cited
2008
Highly Cited
2008
EURACE: A massively parallel agent-based model of the European economy
Highly Cited
2003
Highly Cited
2003
Service-Based Distributed Querying on the Grid
Service-based approaches (such as Web Services and the Open Grid Services Architecture) have gained considerable attention… 
Review
1998
Review
1998
Parallel watershed transformation algorithms for image segmentation
Highly Cited
1996
Highly Cited
1996
PARAMICS—Parallel microscopic simulation of road traffic
This paper describes work done on the original PARAMICS project, which was developed for the Edinburgh Parallel Computing Centre… 
Highly Cited
1995
Highly Cited
1995
A Multi-objective Approach to Constrained Optimisation of Gas Supply Networks: the COMOGA Method
This paper presents a new technique for handling constraints within evolutionary algorithms, and demonstrates its effectiveness… 
Highly Cited
1991
Highly Cited
1991
Forma Analysis and Random Respectful Recombination
  • N. Radcliffe
  • International Conference on Genetic Algorithms
  • 1991
  • Corpus ID: 13935950
Intrinsic parallelism is shown to have application beyond schemata and o-schemata. More general objects called formae are… 
Highly Cited
1991
Highly Cited
1991
Equivalence Class Analysis of Genetic Algorithms
The conventional understanding of genetic algorithms depends upon analysis by schemata and the notion of intrinsic parallelism… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)