483 search results - page 22 / 97 » Timing Games and Shared Memory |
138
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Planning how to interact against bounded memory and unbounded memory learning opponents needs different treatment. Thus far, however, work in this area has shown how to design pla...
115
Voted
SIGMETRICS
2000
ACM
15 years 3 months ago
2000
ACM
Motivated by experience gained during the validation of a recent Approximate Mean Value Analysis (AMVA) model of modern shared memory architectures, this paper re-examines the &qu...
117
Voted
HPDC
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper describes a novel approach to generate an optimized schedule to run threads on distributed shared memory (DSM) systems. The approach relies upon a binary instrumentatio...
129
Voted
WCET
2007
15 years 4 months ago
2007
Memory corruption is one of the most common software failures. For sequential software and multitasking software with synchronized data accesses, it has been shown that program fa...
116
click to vote
TSMC
1998
15 years 3 months ago
1998
— Parallel algorithms are presented for modules of learning automata with the objective of improving their speed of convergence without compromising accuracy. A general procedure...