4940 search results - page 386 / 988 » On the Complexity of Universal Programs |
192
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
Parallel architectures are the way of the future, but are notoriously difficult to program. In addition to the low-level constructs they often present (e.g., locks, DMA, and non-...
195
click to vote
IPPS
2005
IEEE
16 years 10 days ago
2005
IEEE
Computational biology research is now faced with the burgeoning number of genome data. The rigorous postprocessing of this data requires an increased role for high performance com...
148
click to vote
PLDI
2010
ACM
15 years 12 months ago
2010
ACM
Traditional data-oriented programming languages such as dataflow s and stream languages provide a natural abstraction for parallel programming. In these languages, a developer fo...
185
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
188
click to vote
TACS
2001
Springer
15 years 11 months ago
2001
Springer
Network programming is notoriously hard to understand: one has to deal with a variety of protocols (IP, ICMP, UDP, TCP etc), concurrency, packet loss, host failure, timeouts, the c...