1686 search results - page 41 / 338 » Programs as polygraphs: computability and complexity |
IJFCS
2006
14 years 9 months ago
2006
In this paper we present an efficient algorithm for compile-time scheduling and clustering of parallel programs onto parallel processing systems with distributed memory, which is ...
STOC
2001
ACM
15 years 10 months ago
2001
ACM
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
ICEIS
2008
IEEE
15 years 4 months ago
2008
IEEE
— This paper investigates Grid computing from the point of view three basic computing platforms. The platform consists of virtual compute resources, a programming environment all...