4767 search results - page 131 / 954 » Structures for Abstract Rewriting |
113
click to vote
FLOPS
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell's implementation of s...
125
click to vote
AAAI
2004
15 years 3 months ago
2004
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
SCM
2003
15 years 3 months ago
2003
Abstract. Motivated by our work on object-oriented Content Management, this paper proposes an extensible formal framework for delta and merging strategies, each applicable to a spe...
111
Voted
CSL
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
103
click to vote
WDAG
2010
Springer
15 years 20 days ago
2010
Springer
Abstract. Understanding the effect of different progress conditions on the computability of distributed systems is an important and exciting research direction. For a system with n...