1717 search results - page 163 / 344 » A Computable Spectral Theorem |
131
click to vote
CAD
2007
Springer
15 years 4 months ago
2007
Springer
Systematically generalizing planar geometric algorithms to manifold domains is of fundamental importance in computer aided design field. This paper proposes a novel theoretic fra...
136
click to vote
TEC
2010
14 years 11 months ago
2010
Estimation of distribution algorithms (EDAs) are widely used in stochastic optimization. Impressive experimental results have been reported in the literature. However, little work ...
145
click to vote
LICS
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
163
click to vote
ICALP
1997
Springer
15 years 8 months ago
1997
Springer
In the 1980's, Bennett introduced computational depth as a formal measure of the amount of computational history that is evident in an object's structure. In particular,...
135
click to vote
ENTCS
2007
15 years 4 months ago
2007
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether de...