5084 search results - page 34 / 1017 » Proving Possibility Properties |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Because each golden code codeword conveys four information symbols from an -ary QAM alphabet, the complexity of an exhaustive-search decoder is proportional to 4 . In this paper we...
JSS
2008
14 years 10 months ago
2008
This paper explores how process pipeline scheduling may become a viable strategy for executing workflows. It first details a workflow optimization and execution algorithm that redu...
ENTCS
2002
14 years 10 months ago
2002
Meseguer's rewriting logic and the rewriting logic CRWL are two well-known approaches to rewriting as logical deduction that, despite some clear similarities, were designed w...
109
click to vote
STACS
2001
Springer
15 years 3 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
187
click to vote
POPL
2008
ACM
15 years 11 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...