78 citations · 84 across the 6 of their papers we have counts for
6 papers
The N-Player Trust Game and its Replicator Dynamics
Hussein Abbass, Garrison Greenwood, Eleni Petraki
Trust is a fundamental concept that underpins the coherence and resilience of social systems and shapes human behavior. Despite the importance of trust as a social and psychologica…
On the Practicality of Intrinsic Reconfiguration As a Fault Recovery Method in Analog Systems
Garrison W. Greenwood
Evolvable hardware combines the powerful search capability of evolutionary algorithms with the flexibility of reprogrammable devices, thereby providing a natural framework for reco…
On the Isomorphic Embedding of Rectangular Grids in n-cubes
Garrison W. Greenwood
All previously published work on isomorphic grid embeddings into n-cubes has been restricted to binary n-cubes. This paper describes a straightforward method for embedding a A x B…
How to Evolve Safe Control Strategies
G. W. Greenwood, X. Song
Autonomous space vehicles need adaptive control strategies that can accommodate unanticipated environmental conditions. The evaluation of new strategies can often be done only by a…
Revisiting the Complexity of Finding Globally Minimum Energy Configurations in Atomic Clusters
G. W. Greenwood
It has previously been proven that finding the globally minimum energy configuration of an atomic cluster belongs in the class of NP-hard problems. However, this proof is limited o…
Finding Solutions to NP Problems: Philosophical Difference Between Quantum and Evolutionary Search Algorithms
G. W. Greenwood
There is no known polynomial-time algorithm that can solve an NP problem. Evolutionary search has been shown to be a viable method of finding acceptable solutions within a reasonab…