4940 search results - page 611 / 988 » On the Complexity of Universal Programs |
176
click to vote
ENTCS
2007
15 years 6 months ago
2007
Most software is fragile: even the slightest error, such as changing a single bit, can make it crash. As software complexity has increased, development techniques have kept pace t...
149
click to vote
IANDC
2007
15 years 6 months ago
2007
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
190
click to vote
AAECC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
170
click to vote
RTS
2000
15 years 6 months ago
2000
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
281
click to vote
WABI
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present three heuristic strategies for folding RNA sequences into secondary structures including kissing hairpin motifs. The new idea is to construct a kissing hairpin...