Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

Algorithmic skeleton has received attention as an efficient method of parallel programming in recent years. Using the method, the programmer can implement parallel programs easily. In this study, a set of efficient algorithmic skeletons is introduced for use in implementing parallel genetic algorithm (PGA).A performance modelis derived for each skeleton that makes the comparison of skeletons po...

design precedents are available instances of architectural projects by high profile architects and designers, which can be studied and analyzed as knowledge resources for a given project. developing a design knowledge based on a critical study of precedents will be referred to in this paper as precedent-based knowledge. in all stages of designing, design reasoning based on precedents can save d...

In games with multiple, Pareto-rankable equilibria and repeated play, does a history of playing an inefficient equilibrium make it harder for the players to reach the efficient equilibrium? In other words, can people ‘get stuck’ in bad equilibria? Using variants of the stag hunt, previous studies have found support for this, but they have relied on naturally occurring variation in precedent. I ...

We report on an experiment examining behavior and equilibrium selection in two similar, infinitely repeated games, Stag Hunt and Prisoner’s Dilemma under anonymous random matching. We are interested in the role that historical precedents may play for equilibrium selection between these two repeated games. We find that a precedent for efficient play in the repeated Stag Hunt game does not carry ...