14084 search results - page 2518 / 2817 » A Theory for Game Theories |
202
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Despite years of work on retargetable compilers, creating a good, reliable back end for an optimizing compiler still entails a lot of hard work. Moreover, a critical component of ...
253
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
168
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
In functional programming, monadic characterizations of computational effects are normally understood denotationally: they describe how an effectful program can be systematically ...
201
click to vote
STOC
2010
ACM
16 years 4 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
194
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...