Sciweavers

8132 search results - page 1373 / 1627
» Dependability, Abstraction, and Programming
Sort
View
ICSE
2010
IEEE-ACM
15 years 8 months ago
Efficient hybrid typestate analysis by determining continuation-equivalent states
Typestate analysis determines whether a program violates a set of finite-state properties. Because the typestate-analysis problem is statically undecidable, researchers have propo...
Eric Bodden
ESOP
2008
Springer
15 years 8 months ago
Just Forget It - The Semantics and Enforcement of Information Erasure
Abstract. There are many settings in which sensitive information is made available to a system or organisation for a specific purpose, on the understanding that it will be erased o...
Sebastian Hunt, David Sands
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
15 years 8 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
DAGSTUHL
2003
15 years 8 months ago
Components, Features, and Agents in the ABC
Abstract. In this paper, we show how the concepts of objects, components, features and agents are used today in the Agent Building Center (ABC) environment in order to marry the mo...
Tiziana Margaria
EUROPAR
2010
Springer
15 years 7 months ago
Optimized Dense Matrix Multiplication on a Many-Core Architecture
Abstract. Traditional parallel programming methodologies for improving performance assume cache-based parallel systems. However, new architectures, like the IBM Cyclops-64 (C64), b...
Elkin Garcia, Ioannis E. Venetis, Rishi Khan, Guan...
« Prev « First page 1373 / 1627 Last » Next »