We provide a theoretical foundation for the use of Markov strategies in repeated games with asynchronous moves. If admissible strategies must display finite (arbitrarily long) memory and each player incurs a “complexity cost” which depends on the memory length required by her strategy, then every Nash equilibrium must be in Markovian strategies. If, in addition, admissible strategies have unifo...

In this paper, we study k-memory strategies in two-person repeated games. An agent adopting such a strategy makes his decision only based on the action profiles of the previous k rounds. We show that in finitely repeated games, the best response of a k-memory strategy may not even be a constant-memory strategy. However, in infinitely repeated games, one of the best responses against any given k...

Transactional Memory (TM) has been proposed as an architectural extension to enable lock-free data structures. With the ubiquity of multi-core systems, the idea of TM gains new momentum. The motivation for the invention of TM was to simplify the synchronization of parallel threads in a shared memory system. TM features optimistic concurrency as opposed to the pessimistic concurrency with tradit...

Shape memory polymers (SMPs) are polymeric materials capable of recovering from a ‘fixed’ temporary shape to a ‘memorized’ permanent shape upon exposure to an external stimulus. Two structural elements are required for a polymer to exhibit useful shape memory: a network structure that defines the permanent shape (the ‘memory’), and a switching segment that induces a significant change in the mo...

Multiple memory systems are distinguished by different sets of neuronal circuits and operating principles optimized to solve different problems across mammalian species (Tulving and Schacter, 1994). When a rat selects an arm in a plus maze, for example, the choice can be guided by distinct neural systems (White and Wise, 1999) that encode different relationships among perceived stimuli, actions...

Efficiently scheduling parallel tasks on to the processors of a shared-memory multiprocessor is critical to achieving high performance. Given perfect information at compile-time, a static scheduling strategy can produce an assignment of tasks to processors that ideally balances the load among the processors while minimizing the run-time scheduling overhead and the average memory referencing del...

In this thesis we deal with the problem of reducing the memory necessary for implementing winning strategies in infinite games. We present an algorithm that is based on the notion of game reduction. Its key idea is to reduce the problem of computing a solution to a given game to computing a solution to a new game. This new game has an extended game graph which contains the memory to solve the o...

In this paper, we describe how the mapping of virtual to physical memory that is set up by the operating system can have a significant and unexpected impact on the performance of STREAM [6] and a sparse solver “mini-application” that exhibits STREAM-like behavior. The Cray Performance Analysis Toolkit (CrayPAT) [2] is utilized to identify the cause of the performance degradation to be row buffe...

In this paper, we will review the modeling strategies for standard and advanced Flash memory devices based on Floating Gate devices developed by our research group in the last ten years. We will show a complete compact model that includes program/erase and leakage currents that can be used to simulate memory cells in both DC (read operation) and transient conditions (Program/Erase). The same mo...

PURPOSE To investigate the use of assistive technology (AT), unmet needs for AT, and examine correlates of use of memory aids and cognitive strategies among individuals with multiple sclerosis (MS). METHOD A cross-sectional study of 1,063 community dwelling adults with MS in Washington State. A self-report survey assessed use of AT as well as depression, fatigue, mobility, and other demograph...