466 search results - page 57 / 94 » A Theory of Rate-Based Execution |
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We investigate the design of algorithms resilient to memory faults, i.e., algorithms that, despite the corruption of some memory values during their execution, are able to produce...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
ICFP
2007
ACM
15 years 9 months ago
2007
ACM
We present a user-friendly approach to unifying program creation and execution, based on a notion of "tangible values" (TVs), which are visual and interactive manifestat...
ICFP
2006
ACM
15 years 9 months ago
2006
ACM
Despite its powerful module system, ML has not yet evolved for the modern world of dynamic and open modular programming, to which more primitive languages have adapted better so f...
POPL
2010
ACM
15 years 7 months ago
2010
ACM
Traditional transactional memory systems suffer from overly conservative conflict detection, yielding so-called false conflicts, because they are based on fine-grained, low-level ...