8196 search results - page 110 / 1640 » Computational Modeling and Complexity Science |
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain, a program is a set of prioritized rewriting rules, and c...
TCS
1998
14 years 9 months ago
1998
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
109
click to vote
CSIE
2009
IEEE
14 years 7 months ago
2009
IEEE
Grid computing has become very popular in big and widespread scientific communities with high computing demands, like high energy physics. Computing resources are being distribute...
ICCS
2003
Springer
15 years 3 months ago
2003
Springer
FSTTCS
2009
Springer
15 years 4 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...