1716 search results - page 164 / 344 » Proving Conditional Termination |
80
Voted
CSL
2001
Springer
15 years 5 months ago
2001
Springer
We reveal a symmetric structure in the ho/n games model of innocent strategies, introducing rigid strategies, a concept dual to bracketed strategies. We prove a direct definabilit...
104
click to vote
ICRA
1999
IEEE
15 years 5 months ago
1999
IEEE
A new design method for non-time based tracking controller of mobile robots is presented. The new design method converts a controller designed by traditional time-based approaches ...
93
Voted
ASIACRYPT
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
112
click to vote
ECOOPW
1999
Springer
15 years 5 months ago
1999
Springer
This paper formalizes the folklore result that strongly-typed applets are more secure than untyped ones. We formulate and prove several security properties that all well-typed app...
93
Voted
ECAI
1998
Springer
15 years 5 months ago
1998
Springer
In probabilistics, reasoning at optimum entropy (ME-reasoning) has proved to be a most sound and consistent method for inference. This paper investigates its properties in the fram...