1717 search results - page 279 / 344 » A Computable Spectral Theorem |
RANDOM
1997
Springer
15 years 4 months ago
1997
Springer
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞ ; the study of resource-bounded measure ...
ICCAD
1994
IEEE
15 years 4 months ago
1994
IEEE
In this paper, we study the simultaneousdriver and wire sizing (SDWS) problem under two objective functions: (i) delay minimization only, or (ii) combined delay and power dissipat...
105
Voted
ECAI
1992
Springer
15 years 4 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
106
Voted
CONCUR
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
117
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...