234 search results - page 43 / 47 » Examples of Termination |
CCS
2001
ACM
15 years 2 months ago
2001
ACM
Automated trust negotiation is an approach to establishing trust between strangers through the exchange of digital credentials and the use of access control policies that specify ...
107
click to vote
DDEP
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Our component-based parametrisable font system is a newly developed font description and reproduction technology. It incorporates for each basic character shape a softwar...
ICCAD
1999
IEEE
15 years 1 months ago
1999
IEEE
A delay abstraction of a combinational module is a compact representation of the delay information of the module, which carries effective pin-to-pin delay for each primary-input/pr...
ICS
2010
Tsinghua U.
15 years 1 months 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...
61
Voted
FSTTCS
1993
Springer
15 years 1 months ago
1993
Springer
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...