4940 search results - page 425 / 988 » On the Complexity of Universal Programs |
160
click to vote
EJC
2000
15 years 8 months ago
2000
We present a new model for generating network applications. Our model is based on trees communicating with each other. Our model is simple to understand, but yet powerful enough to...
176
click to vote
PDPTA
1996
15 years 8 months ago
1996
This paper presents a taxonomy of parallel and distributed debuggers based on execution replay. Programming of distributed and parallel systems is a complex task. Amongst the many...
191
click to vote
EUROPAR
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Algorithmic Skeletons offer high-level abstractions for parallel programming based on recurrent parallelism patterns. Patterns can be combined and nested into more comple...
164
click to vote
CSUR
2000
15 years 6 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...
139
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...