221 search results - page 27 / 45 » Analyzing the Implicit Computational Complexity of object-or... |
178
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
As computer systems continue to become more powerful and comdo programs. High-level abstractions introduced to deal with complexity in large programs, while simplifying human reas...
100
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
The ability to detect ambiguities in context-free grammars is vital for their use in several fields, but the problem is undecidable in the general case. We present a safe, conser...
IPCO
2008
14 years 11 months ago
2008
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
71
Voted
EUROPAR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Transactional memory systems trade ease of programming with runtime performance losses in handling transactions. This paper focuses on starvation effects that show up in ...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...