Abstract. We study the necessary and sufficient assumptions for universally composable (UC) computation, both in terms of setup and computational assumptions. We look at the common...
The information processing capabilities of many proteins are currently unexplored. The complexities and high dimensional parameter spaces make their investigation impractical. Diff...
Chris Lovell, Gareth Jones, Steve R. Gunn, Klaus-P...
We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behavior yet capable for purposeful computation. The automaton implements Boolean gates via p...
This paper presents an improved differential evolution (IDE) method for the solution of large-scale unit commitment (UC) problems. The objective of the proposed scheme is to determ...