1716 search results - page 152 / 344 » Proving Conditional Termination |
97
Voted
ISIPTA
2003
IEEE
15 years 6 months ago
2003
IEEE
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symme...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. A hybrid network of evolutionary processors consists of several processors which are placed in nodes of a virtual graph and can perform one simple operation only on the w...
111
Voted
ICDT
2003
ACM
15 years 5 months ago
2003
ACM
We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redu...
102
Voted
APLAS
2000
ACM
15 years 5 months ago
2000
ACM
We present a generalized let-polymorphic type inference algorithm, prove that any of its instances is sound and complete with respect to the Hindley/Milner let-polymorphic type sy...
116
Voted
ALP
1997
Springer
15 years 4 months ago
1997
Springer
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...