1716 search results - page 51 / 344 » Proving Conditional Termination |
92
Voted
MOR
2006
15 years 3 months ago
2006
We introduce an axiomatic definition of a conditional convex risk mapping and we derive its properties. In particular, we prove a representation theorem for conditional risk mappi...
155
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
136
click to vote
SIAMCO
2008
15 years 3 months ago
2008
A class of optimal control problem for a semilinear elliptic partial differential equation with control constraints is considered. It is well known that sufficient second-order con...
113
click to vote
SIGECOM
2008
ACM
15 years 3 months ago
2008
ACM
The Gibbard-Satterthwaite Theorem states that (in unrestricted settings) any reasonable voting rule is manipulable. Recently, a quantitative version of this theorem was proved by ...
125
click to vote
ECAI
2010
Springer
15 years 4 months ago
2010
Springer
We define an Intuitionistic Conditional Logic for Access Control called CICL . The logic CICL is based on a conditional language allowing principals to be defined as arbitrary form...