4047 search results - page 189 / 810 » Some Properties and Some Problems on Set Functors |
130
click to vote
ICDCSW
2005
IEEE
15 years 12 months ago
2005
IEEE
Although a self-stabilizing system that suffers from a transient fault is guaranteed to converge to a legitimate state after a finite number of steps, the convergence can be slow ...
165
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Having principal typings (for short PT) is an important property of type systems. This property guarantees the possibility of type deduction which means it is possible to develop a...
160
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
ABSTRACT. Formalisms involving some degree of nondeterminism are frequent in computer science. In particular, various programming or specification languages are based on term rewr...
160
click to vote
MLQ
2007
15 years 5 months ago
2007
Let ω denote the set of natural numbers. For functions f, g : ω → ω, we say that f is dominated by g if f(n) < g(n) for all but finitely many n ∈ ω. We consider the st...
185
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...