7197 search results - page 1130 / 1440 » On the computational power of BlenX |
153
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
: Soziale Netze entsprechen dem Trend einer Individualisierung der Mediennutzung. Dieser Trend ist ambivalent: implizite Erwartungen in Bezug auf Individualisierung wie Selbstbesti...
141
click to vote
APAL
2010
15 years 6 months ago
2010
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
200
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
200
click to vote
IJFCS
2006
15 years 6 months ago
2006
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
194
click to vote
PPDP
1999
Springer
15 years 11 months ago
1999
Springer
Curry is a multi-paradigm declarative language covering functional, logic, and concurrent programming paradigms. Curry’s operational semantics is based on lazy reduction of expre...