Sciweavers

2482 search results - page 130 / 497
» Characterizing Programming Systems Allowing Program Self-ref...
Sort
View
CF
2010
ACM
14 years 1 months ago
Exposing parallelism and locality in a runtime parallel optimization framework
Runtime parallel optimization has been suggested as a means to overcome the difficulties of parallel programming. For runtime parallel optimization to be effective, parallelism a...
David A. Penry, Daniel J. Richins, Tyler S. Harris...
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 9 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
HPCA
2006
IEEE
14 years 8 months ago
Completely verifying memory consistency of test program executions
An important means of validating the design of commercial-grade shared memory multiprocessors is to run a large number of pseudo-random test programs on them. However, when intent...
Chaiyasit Manovit, Sudheendra Hangal
ECOOP
2005
Springer
14 years 1 months ago
Attached Types and Their Application to Three Open Problems of Object-Oriented Programming
The three problems of the title — the first two widely discussed in the literature, the third less well known but just as important for further development of object technology ...
Bertrand Meyer
SIGSOFT
2007
ACM
14 years 9 months ago
Programming asynchronous layers with CLARITY
Asynchronous systems components are hard to write, hard to reason about, and (not coincidentally) hard to mechanically verify. In order to achieve high performance, asynchronous c...
Prakash Chandrasekaran, Christopher L. Conway, Jos...