1012 search results - page 86 / 203 » Process Algebra with Backtracking |
TIME
1994
IEEE
14 years 2 days ago
1994
IEEE
We formulate an algebra of binary temporal relations between events the number of occurrences of which is unknown, but which are known to recur in time. Ontologically, we view the...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In our previous work (`An Algebraic Watchdog for Wireless Network Coding'), we proposed a new scheme in which nodes can detect malicious behaviors probabilistically, police th...
ENTCS
2006
13 years 8 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
SIGMOD
1996
ACM
14 years 3 days ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
Our paper describes the first provably-efficient algorithm for determining protein structures de novo, solely from experimental data. We show how the global nature of a certain ...