1716 search results - page 50 / 344 » Proving Conditional Termination |
ICS
2010
Tsinghua U.
14 years 25 days ago
2010
Tsinghua U.
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
PODC
2010
ACM
14 years 18 days ago
2010
ACM
Wait-freedom and obstruction-freedom have received a lot of attention in the literature. These are symmetric progress conditions in the sense that they consider all processes as b...
ENTCS
2007
13 years 8 months ago
2007
The dependency pairs method is one of the most powerful technique for proving termination of rewriting and it is currently central in most automatic termination provers. Recently,...
IJAR
2007
13 years 8 months ago
2007
In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L usi...
UAI
2004
13 years 10 months ago
2004
We formulate and prove an axiomatic characterization of conditional information geometry, for both the normalized and the nonnormalized cases. This characterization extends the ax...