4403 search results - page 851 / 881 » Galois Theory of Algorithms |
ERSHOV
1989
Springer
15 years 2 months ago
1989
Springer
This paper reports two experiments with implementations of constructions from theoretical computer science. The first one deals with Kleene’s and Rogers’ second recursion the...
101
Voted
ATAL
2007
Springer
15 years 2 months ago
2007
Springer
Norm-governed virtual organizations define, govern and facilitate coordinated resource sharing and problem solving in societies of agents. With an explicit account of norms, openn...
80
Voted
CASES
2007
ACM
15 years 2 months ago
2007
ACM
For memory constrained environments like embedded systems, optimization for program size is often as important, if not more important, as optimization for execution speed. Commonl...
CIKM
2009
Springer
15 years 2 months ago
2009
Springer
This paper addresses the concept of Blogger-Centric Contextual Advertising, which refers to the assignment of personal ads to any blog page, chosen in according to bloggers' ...
74
Voted
CIE
2010
Springer
15 years 2 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...