804 search results - page 117 / 161 » On the Termination of the Chase Algorithm |
192
Voted
POPL
2006
ACM
16 years 1 months ago
2006
ACM
This paper specifies, via a Hoare-like logic, an interprocedural and flow sensitive (but termination insensitive) information flow analysis for object-oriented programs. Pointer a...
93
Voted
RECOMB
2008
Springer
16 years 1 months ago
2008
Springer
Abstract. Contemporary inferences about evolution occasionally involve analyzing infinitely large feature spaces, requiring specific algorithmic techniques. We consider parsimony a...
STOC
2001
ACM
16 years 1 months ago
2001
ACM
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
77
Voted
WDAG
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
114
click to vote
ESA
2009
Springer
15 years 7 months ago
2009
Springer
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impa...